ReachFewL = ReachUL

We show that two complexity classes introduced about two decades ago are unconditionally equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every input have at most one computation path from the start configuration to any other configuration. ReachFewL, a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational complexity 2014-03, Vol.23 (1), p.85-98
Hauptverfasser:	Garvin, Brady, Stolee, Derrick, Tewari, Raghunath, Vinodchandran, N. V.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis Computer Science
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We show that two complexity classes introduced about two decades ago are unconditionally equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every input have at most one computation path from the start configuration to any other configuration. ReachFewL, a natural generalization of ReachUL, is the class of problems decided by nondeterministic log-space machines which on every input have at most polynomially many computation paths from the start configuration to any other configuration. We show that ReachFewL = ReachUL.
ISSN:	1016-3328 1420-8954
DOI:	10.1007/s00037-012-0050-8