Jump to Content
Your Recent History
View Cart
Logged Out Log In
SIAM J. Comput. 33, pp. 852-869 (18 pages)
Counting Complexity of Solvable Black-Box Group Problems
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookWe place many computational problems over solvable black-box groups in the counting complexity classes SPP or LWPP\@. The classes SPP and LWPP are considered classes of low counting complexity. In particular, SPP is low (powerless when used as oracles) for all gap-definable counting classes (PP\@, C$_=$P\@, Mod$_k$P\@, etc.) and LWPP is low for PP and C$_=$P\@. The results improve the upper bounds for these problems proved in [Arvind and Vinodchandran, Theoret. Comput. Sci., 180 (1997), pp. 17--45], where the authors place these problems in randomized versions of SPP and LWPP. Because of the randomization, upper bounds in that paper implied lowness only for the class PP. The results in this paper favor the belief that these problems are unlikely to be complete for NP.
© 2004 Society for Industrial and Applied Mathematics
RELATED DATABASES
To view database links for this article,
you need to log in.
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
Digital Object Identifier
For access to fully linked references, you need to log in.
ALL SIAM Content
Scitation
Google Scholar