Abstract
The computational power of the counting class ModP, which generalizes the classes Mod/sub p/P, p prime, is investigated. It is shown that ModP is truth-table equivalent in power to MP, and that ModP is contained in the class AmpMP. As a consequence, the lowness of AmpMP or of ModP for MP would imply the collapse of the counting hierarchy (CH) to MP. Further, every set in C=P is shown to be reducible to a ModP set via a random many-one reduction that uses only logarithmically many random bits. Therefore, ModP and AmpMP are not closed under such reductions unless CH collapses. Finally, ModP is generalized to the class Mod/sub */P, which turns out to be a superclass of C=P. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
