PP Is Closed under Truth-Table Reductions

PP Is Closed under Truth-Table Reductions

Beigel, Reingold, and Spielman (J. Comput. System Sci.50, 191–202 (1995)) showed that PP is closed under intersection and a variety of special cases of polynomial-time truth-table closure. We extend their techniques to show that PP is closed under general polynomial-time truth-table reductions. We a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information and computation 1996-01, Vol.124 (1), p.1-6
Hauptverfasser: Fortnow, Lance, Reingold, Nick
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Automata. Abstract machines. Turing machines
Computer science
control theory
systems
Exact sciences and technology
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Beigel, Reingold, and Spielman (J. Comput. System Sci.50, 191–202 (1995)) showed that PP is closed under intersection and a variety of special cases of polynomial-time truth-table closure. We extend their techniques to show that PP is closed under general polynomial-time truth-table reductions. We also show that PP is closed under constant-round truth-table reductions.
ISSN:0890-5401
1090-2651
DOI:10.1006/inco.1996.0001