Two Remarks on the Power of Counting
Name
MIT-LCS-TM-228.pdf
Size
1.92 MB
Format
Adobe PDF
Checksum (MD5)
8bb84c55f64af99c58909537710a0cd7
Author(s)
Papadimitriou, Christos H.
Zachos, Stathis K.
Date Issued
August 1982
Series/Report no.
MIT-LCS-TM-228
Abstract
The relationship between the polynomial hierarchy and Valiant's class #P is at present unknown. We show that some low portions of the polynomial hierarchy, namely deterministic polynomial algorithms using an NP oracle at most a logarithmic number of times, can be simulated by one #P computation. We also show that the class of problems solvable by polynomial-time nondeterministic Turing machines which accept whenever there is an odd number of accepting computations is idempotent, that is closed under usage of oracles from the same class.
Persistent DSpace Link
