Pages that link to "Item:Q3675520"
From MaRDI portal
The following pages link to On Circuit-Size Complexity and the Low Hierarchy in NP (Q3675520):
Displaying 33 items.
- P-selectivity: Intersections and indices (Q673115) (← links)
- Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes (Q809600) (← links)
- On self-reducibility and weak P-selectivity (Q1054475) (← links)
- On some natural complete operators (Q1064780) (← links)
- Complexity and structure (Q1073788) (← links)
- On helping by robust oracle machines (Q1097695) (← links)
- Graph isomorphism is in the low hierarchy (Q1116696) (← links)
- Restricted relativizations of probabilistic polynomial time (Q1186606) (← links)
- Turing machines with few accepting computations and low sets for PP (Q1190987) (← links)
- Logarithmic advice classes (Q1193903) (← links)
- Hard promise problems and nonuniform complexity (Q1261468) (← links)
- Probabilistic complexity classes and lowness (Q1263979) (← links)
- Boolean operations, joins, and the extended low hierarchy (Q1275091) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
- Sparse selfreducible sets and nonuniform lower bounds (Q1755786) (← links)
- Sets with small generalized Kolmogorov complexity (Q1821559) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Nonuniform lowness and strong nonuniform lowness (Q1894328) (← links)
- A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality (Q2182332) (← links)
- Separating the low and high hierarchies by oracles (Q2638773) (← links)
- Do there exist complete sets for promise classes? (Q3107337) (← links)
- Self-reducible sets of small density (Q3210176) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- Nonlevelable sets and immune sets in the accepting density hierarchy inNP (Q3711750) (← links)
- New Collapse Consequences of NP Having Small Circuits (Q4210150) (← links)
- On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy (Q4651502) (← links)
- Complexity classes between $\Theta _k^P$ and $\Delta _k^P$ (Q4717047) (← links)
- A refinement of the low and high hierarchies (Q4841766) (← links)
- Upper bounds for the complexity of sparse and tally descriptions (Q4864446) (← links)
- UP and the low and high hierarchies: A relativized separation (Q4895813) (← links)
- On the NP-Completeness of the Minimum Circuit Size Problem. (Q5275370) (← links)
