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...

Full description

Saved in:
Bibliographic Details
Published inInformation and computation Vol. 124; no. 1; pp. 1 - 6
Main Authors Fortnow, Lance, Reingold, Nick
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 10.01.1996
Elsevier
Subjects
Applied sciences
Automata. Abstract machines. Turing machines
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Computability and decidability
Complexity class
Turing machines
Probabilistic automaton
Polynomial time
Closure theorem
Online AccessGet full text

Cover

More Information
Summary: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