Searching for "Space complexity of alternating Turing machines." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

CTL + is complete for double exponential time
by Jan Johannsen, Martin Lange — 2003 — Proc. 30th Int. Coll. on Automata, Logics and Programming, ICALP’03, volume 2719 of LNCS, pages 767 – 775
… to be equivalent w.r.t. space complexity. An alternating Turing Machine M is ofthe form M = ( Q, \Sigma , q0, qa…
Cited by 4 (2 self) – Add To MetaCart

Algebraic Methods for Interactive Proof Systems
by Carsten Lund, Lance Fortnow, Howard Karloff, Noam Nisan — 1990
… polynomial equivalence between time-space complexity of alternating Turing machines and the time-space…
Cited by 229 (26 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB