Pages that link to "Item:Q3990656"

The following pages link to Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy (Q3990656):

Displaying 39 items.

• The size of SPP (Q596117) (← links)
• On the acceptance power of regular languages (Q672323) (← links)
• Modulo classes and logarithmic advice (Q672652) (← links)
• Complexity classes of equivalence problems revisited (Q716333) (← links)
• Complexity of counting the optimal solutions (Q837174) (← links)
• On bounded-probability operators and C\(_ =\)P (Q1313771) (← links)
• Gap-definable counting classes (Q1318473) (← links)
• Perceptrons, PP, and the polynomial hierarchy (Q1346615) (← links)
• On ACC (Q1346616) (← links)
• Representing Boolean functions as polynomials modulo composite numbers (Q1346617) (← links)
• Algebraic methods and bounded formulas (Q1377552) (← links)
• Universally serializable computation (Q1384538) (← links)
• Relativized worlds with an infinite hierarchy (Q1606916) (← links)
• Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
• Tally NP sets and easy census functions. (Q1854340) (← links)
• One complexity theorist's view of quantum computing (Q1870556) (← links)
• Parameterized random complexity (Q1946497) (← links)
• Two queries (Q1961371) (← links)
• The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
• Counting and enumerating preferred database repairs (Q2193286) (← links)
• A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
• Counting subset repairs with functional dependencies (Q2221807) (← links)
• Uniform proofs of ACC representations (Q2402964) (← links)
• The complexity of two problems on arithmetic circuits (Q2465637) (← links)
• Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
• LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
• A note on the circuit complexity of PP (Q2576885) (← links)
• Learning $$AC^0$$ Under k-Dependent Distributions (Q2988821) (← links)
• Complexity of Counting the Optimal Solutions (Q3511323) (← links)
• On the power of deterministic reductions to C=P (Q4032933) (← links)
• Immunity and Simplicity for Exact Counting and Other Counting Classes (Q4265536) (← links)
• Generalized theorems on relationships among reducibility notions to certain complexity classes (Q4298368) (← links)
• On polynomial approximations to AC (Q4633319) (← links)
• (Q5090936) (← links)
• (Q5121907) (← links)
• Transducing Markov sequences (Q5501935) (← links)
• The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610) (← links)
• Dot operators (Q5958134) (← links)
• On the probabilistic degree of OR over the reals (Q6074648) (← links)