SOFSEM 2004: Theory and Practice of Computer Science

DOI10.1007/B95046zbMath1202.68202OpenAlexW2916538296MaRDI QIDQ5902006

Tomoyuki Yamakami, Jack C. H. Lin, Kohtaro Tadaki

Publication date: 4 June 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95046

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

Pseudorandom generators against advised context-free languages ⋮ Amount of nonconstructivity in deterministic finite automata ⋮ One-way reversible and quantum finite automata with advice ⋮ Constant-space quantum interactive proofs against multiple provers ⋮ Amount of Nonconstructivity in Finite Automata ⋮ Context-free languages can be accepted with absolutely no space overhead

This page was built for publication: SOFSEM 2004: Theory and Practice of Computer Science