Pages that link to "Item:Q1163371"
From MaRDI portal
The following pages link to Some observations on the probabilistic algorithms and NP-hard problems (Q1163371):
Displaying 27 items.
- On quasilinear-time complexity theory (Q672330) (← links)
- Approximating the partition function of planar two-state spin systems (Q743131) (← links)
- Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes (Q809600) (← links)
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle? (Q948913) (← links)
- BPP and the polynomial hierarchy (Q1052094) (← links)
- Does co-NP have short interactive proofs ? (Q1108004) (← links)
- Probabilistic quantifiers and games (Q1112019) (← links)
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
- Probabilistic complexity classes and lowness (Q1263979) (← links)
- Computational complexity of loss networks (Q1318715) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- Polynomial time samplable distributions (Q1578504) (← links)
- Degrees of Dowd-type generic oracles (Q1854543) (← links)
- Equivalence problems for circuits over sets of natural numbers (Q2268343) (← links)
- Bounded truth table does not reduce the one-query tautologies to a random oracle (Q2388434) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
- Resource bounded symmetry of information revisited (Q2575757) (← links)
- Natural proofs versus derandomization (Q2805512) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- A Downward Collapse within the Polynomial Hierarchy (Q4210153) (← links)
- Fault-tolerance and complexity (Extended abstract) (Q4630260) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- Generalized lowness and highness and probabilistic complexity classes (Q4729352) (← links)
- On closure properties of bounded two-sided error complexity classes (Q4835865) (← links)
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models (Q4969061) (← links)
- Elimination Distances, Blocking Sets, and Kernels for Vertex Cover (Q5099101) (← links)
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks (Q6080638) (← links)
