Constant-coin constant-space verifiers achieve arbitrarily small error for linear-time 2nfa(k) languages, a subset of NL.
Condon, The complexity of the max word problem and the power of one-way interactive proof systems, computational complex ity 3 (3) (1993) 292–305
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2020 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error
Constant-coin constant-space verifiers achieve arbitrarily small error for linear-time 2nfa(k) languages, a subset of NL.