Abstract
We give a new characterization of NL as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Say, A. C. C., & YakaryIlmaz, A. (2012). Finite state verifiers with constant randomness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7318 LNCS, pp. 646–654). https://doi.org/10.1007/978-3-642-30870-3_65
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
