Polynomial-time 1-Turing reductions from #PH to #P

Theoretical Computer Science

Volumn 100, Issue 1, 1992, Pages 205-221

  Toda, Seinosuke ^a   Watanabe, Osamu ^b  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

1-TURING REDUCIBILITY; POLYNOMIAL TIME REDUCIBILITY; RELATIVE COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0026879923     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(92)90369-Q     Document Type: Article

References (33)

1. On counting problems and the polynomial-time hierarchy
2. The polynomial-time hierarchy and sparse oracles
3. NP[log]⊆PP
4. On the power of parity polynomial time
5. Alternation
6. Characterizations of pushdown machines in terms of time-bounded computers
7. Computational complexity of probabilistic Turing machines
8. On ranking
9. Some observations on the probabilistic algorithms and NP-hard problems
10. On counting and approximation
11. Turing machines with few accepting computations and low sets for PP
12. The complexity of optimization problems
13. BPP and the polynomial-time hierarchy
14. Relativizing complexity classes with sparse oracles
15. Two remarks on the power of counting
16. The power of counting
17. Probabilistic complexity classes and lowness
18. On the difference between one and many
19. A complexity theoretic approach to randomness
20. The polynomial-time hierarchy
21. On approximation algorithms for #P
22. On the computational power of PP and ⊕ P
23. Restricted relativizations of probabilistic polynomial time
24. An oracle characterization of the counting hierarchy
25. Relative complexity of checking and evaluating
26. The complexity of computing the permanent
27. The complexity of reliability and enumeration problems
28. NP is as easy to detecting unique solutions
29. The complexity of combinatorial problems with succinct input representation
30. Some observations on the connection between counting and recursion
31. Complete sets and the polynomial-time hierarchy
32. Robustness of probabilistic computational complexity classes under definitional perturbations
33. A decisive characterization of BPP