Computing functions with parallel queries to NP

The class Θ 2 p of languages polynomial-time truth-table reducible to sets in NP has a wide range of different characterizations. We consider several functional versions of Θ 2 p based on these characterizations. We show that in this way the three function classes FL log NP, FP log NP, and FP ∥ NP a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 141; H. 1; S. 175 - 193
Hauptverfasser:	Jenner, Birgit, Torán, Jacobo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 17.04.1995 Elsevier
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Exact sciences and technology Theoretical computing NP complete problem Parallel computation Algorithm Computational complexity Computing method Polynomial time
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!