An optimal $O(\log \log n)$ time algorithm for parallel superprimitivity testing

Iliopoulos, Costas S.; Park, Kunsoo

by Costas S. Iliopoulos, Kunsoo Park

Abstract:

Reference:

An optimal $O(\log \log n)$ time algorithm for parallel superprimitivity testing (Costas S. Iliopoulos, Kunsoo Park), In Journal of the Korean Information Science Society, volume 21, 1994. ()

Bibtex Entry:

@string{jkiss="Journal of the Korean Information Science Society"}
@ARTICLE{IP94ParallelSuperprimitivity,
  AUTHOR =       "Costas S. Iliopoulos and Kunsoo Park",
  TITLE =        "An optimal {$O(\log \log n)$} time algorithm for parallel superprimitivity testing",
  JOURNAL =      JKISS,
  YEAR =         "1994",
  volume =       "21",
  number =       "8",
  pages =        "1400--1404",
  month =        "",
  note =         "",
  abstract =     "",
  keywords =     "",
  source =       ""
}