Searching for "Gap-Definable Counting Classes." – sorted by Relevance.
-
Gap-Definable Counting Classes
- Gap-Definable Counting Classes Stephen A. Fenner y Computer Science Department University
- Cited by 115 (12 self) – Add To MetaCart
-
Degree bounds on polynomials and relativization theory
- separations. Before stating our contributions, we give an overview of gap-definable counting classes which
- Cited by 3 (2 self) – Add To MetaCart
-
Quantum and classical complexity classes: Separations, collapses, and closure properties
- classes. In particular, they study the complexity ����� of using gap-definable counting classes [12
- Cited by 2 (2 self) – Add To MetaCart
-
Applications of Polynomial and Rational Approximation. . .
- , and S. Kurtz. Gap-definable counting classes. In Proceedings of the 6th Annual Conference on Structure
- Add To MetaCart
-
Quantum and Classical Complexity Classes:Separations, Collapses, and Closure Properties
- classes. In particular, they study the complexity of BQP using gap-definable counting classes [12].Loosely
- Add To MetaCart
-
Quantum and Classical Complexity Classes:Separations, Collapses, and Closure Properties
- classes. In particular, they study the complexity of BQP using gap-definable counting classes [12].Loosely
- Add To MetaCart
-
The Size of SPP
- counting complexity class. In particular, it is low for all "gap-definable" classes, including PP and \Phi
- Add To MetaCart
-
The size of SPP
- ]) SPP is low for all gap-definable counting classes. In particular, SPP SPP = SPP and SPP is closed
- Cited by 3 (1 self) – Add To MetaCart
-
Error-Bounded Probabilistic Computations Between MA and AM
- 's relationship to gap-definable counting classes, in particular with the class AWPP introduced by Fenner et al
- Cited by 3 (1 self) – Add To MetaCart

