Counting Complexity of Solvable Black-Box Group Problems

Abstract

We 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, ModkP, etc.) and LWPP is low for PP and C=P. The results… (More)
DOI: 10.1137/S0097539703420651

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics