Pages that link to "Item:Q3028343"
From MaRDI portal
The following pages link to The polynomial-time hierarchy and sparse oracles (Q3028343):
Displaying 33 items.
- Manipulating the quota in weighted voting games (Q420828) (← links)
- Relativized isomorphisms of NP-complete sets (Q687510) (← links)
- The complexity of power-index comparison (Q1001906) (← links)
- On bounded query machines (Q1085975) (← links)
- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy (Q1118405) (← links)
- Strong and robustly strong polynomial-time reducibilities to sparse sets (Q1177170) (← links)
- The polynomial-time hierarchy and oracle set \(A \in \text{PH/poly}\) (Q1179317) (← links)
- Separating complexity classes with tally oracles (Q1185002) (← links)
- Restricted relativizations of probabilistic polynomial time (Q1186606) (← links)
- Turing machines with few accepting computations and low sets for PP (Q1190987) (← links)
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
- Logarithmic advice classes (Q1193903) (← links)
- A very hard log-space counting class (Q1208403) (← links)
- Hard promise problems and nonuniform complexity (Q1261468) (← links)
- On hiding information from an oracle (Q1263281) (← links)
- A note on sparse sets and the polynomial-time hierarchy (Q1263964) (← links)
- Simple characterizations of \(P(\# P)\) and complete problems (Q1333395) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- Approximate inference in Bayesian networks: parameterized complexity results (Q1726381) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Nonuniform lowness and strong nonuniform lowness (Q1894328) (← links)
- Complexity classes and sparse oracles (Q1894447) (← links)
- Proper hierarchies in polylogarithmic time and absence of complete problems (Q2206779) (← links)
- A note on bi-immunity and \(p\)-closeness of \(p\)-cheatable sets in \(P\)/poly (Q2366689) (← links)
- The effect of combination functions on the complexity of relational Bayesian networks (Q2409113) (← links)
- Separating the low and high hierarchies by oracles (Q2638773) (← links)
- Self-reducibility (Q2639637) (← links)
- Self-reducible sets of small density (Q3210176) (← links)
- (Q3811710) (← links)
- An observation on probability versus randomness with applications to complexity classes (Q4298369) (← links)
- New collapse consequences of NP having small circuits (Q4645178) (← links)
- On complexity classes and algorithmically random languages (Q5096791) (← links)
