Pages that link to "Item:Q3359758"
From MaRDI portal
The following pages link to PP is as Hard as the Polynomial-Time Hierarchy (Q3359758):
Displaying 50 items.
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- The fewest clues problem (Q1623268) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- On the complexity of energy storage problems (Q1662159) (← links)
- An abstract model for branching and its application to mixed integer programming (Q1683695) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Fine-grained dichotomies for the Tutte plane and Boolean \#CSP (Q1725642) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- PP is closed under intersection (Q1892214) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- Shallow laconic P-systems can count (Q1983024) (← links)
- Connectivity of joins, cohomological quantifier elimination, and an algebraic Toda's theorem (Q2003990) (← links)
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) (Q2087770) (← links)
- Structural control in weighted voting games (Q2098945) (← links)
- Completeness, approximability and exponential time results for counting problems with easy decision version (Q2143122) (← links)
- Probabilistic causes in Markov chains (Q2147196) (← links)
- On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
- Thirty years of credal networks: specification, algorithms and complexity (Q2206469) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
- The equivalence of sampling and searching (Q2254498) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- Complexity results for probabilistic answer set programming (Q2302961) (← links)
- Definability for model counting (Q2303508) (← links)
- Algorithms and complexity for Turaev-Viro invariants (Q2316773) (← links)
- A complexity theory of constructible functions and sheaves (Q2340508) (← links)
- On the probabilistic closure of the loose unambiguous hierarchy (Q2346573) (← links)
- A circuit-based proof of Toda's theorem (Q2366565) (← links)
- Same-decision probability: a confidence measure for threshold-based decisions (Q2375339) (← links)
- Uniform proofs of ACC representations (Q2402964) (← links)
- The effect of combination functions on the complexity of relational Bayesian networks (Q2409113) (← links)
- On the connection between interval size functions and path counting (Q2410681) (← links)
- The minimum oracle circuit size problem (Q2410683) (← links)
- Dual VP classes (Q2410687) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy (Q2456368) (← links)
- Algorithms for modular counting of roots of multivariate polynomials (Q2482732) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Computational complexity of stochastic programming problems (Q2492669) (← links)
- LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Pure Nash equilibria in a generalization of congestion games allowing resource failures (Q2670923) (← links)
