Windable Heads & Recognizing NL with Constant Randomness

Every language in NL has a \(k\)-head two-way nondeterministic finite automaton (2nfa(\(k\))) recognizing it. It is known how to build a constant-space verifier algorithm from a 2nfa(\(k\)) for the same language with constant-randomness, but with error probability \(\tfrac{k^2-1}{2k^2}\) that can no...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2019-12
1. Verfasser:	Gezer, M. Utkan
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Computer Science - Computational Complexity Error reduction Randomness
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!