The following pages link to Gap-definable counting classes (Q1318473):
Displaying 50 items.
- The consequences of eliminating NP solutions (Q458458) (← links)
- The size of SPP (Q596117) (← links)
- Arithmetization: A new method in structural complexity theory (Q685721) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Positive and negative proofs for circuits and branching programs (Q896677) (← links)
- On the autoreducibility of functions (Q970103) (← links)
- Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Upward separation for FewP and related classes (Q1341678) (← links)
- Recursion theoretic characterizations of complexity classes of counting functions (Q1365942) (← links)
- An oracle builder's toolkit (Q1398366) (← links)
- The complexity of the characteristic and the minimal polynomial. (Q1401240) (← links)
- On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Exact learning via teaching assistants (Q1575459) (← links)
- The counting complexity of group-definable languages (Q1575546) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- Relativized worlds with an infinite hierarchy (Q1606916) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Complexity limitations on quantum computation (Q1961375) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- The minimum oracle circuit size problem (Q2410683) (← links)
- Comparing action descriptions based on semantic preferences (Q2457799) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
- A common algebraic description for probabilistic and quantum computations (Q2575744) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- Restrictive Acceptance Suffices for Equivalence Problems (Q4504964) (← links)
- UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS (Q4528761) (← links)
- Fault-tolerance and complexity (Extended abstract) (Q4630260) (← links)
- On the power of generalized Mod-classes (Q4864444) (← links)
- Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
- UP and the low and high hierarchies: A relativized separation (Q4895813) (← links)
- (Q5005153) (← links)
- Graph isomorphism is low for PP (Q5096798) (← links)
- (Q5121907) (← links)
- (Q5216300) (← links)
- SELF-SPECIFYING MACHINES (Q5249003) (← links)
- ANALYSIS OF QUANTUM FUNCTIONS (Q5696940) (← links)
- On the hardness of the noncommutative determinant (Q5916037) (← links)
- Parameterised counting in logspace (Q6093373) (← links)
- Semiring reasoning frameworks in AI and their computational complexity (Q6488781) (← links)
- Power of counting by nonuniform families of polynomial-size finite automata (Q6546609) (← links)
- On the power of counting the total number of computation paths of NPTMs (Q6636085) (← links)
- Weighted automata and logics meet computational complexity (Q6647756) (← links)
