The following pages link to Relativized circuit complexity (Q1069299):
Displaying 35 items.
- NP-hard sets are superterse unless NP is small (Q290182) (← links)
- Relative to a random oracle, P/poly is not measurable in EXP (Q294619) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- On sets Turing reducible to p-selective sets (Q675861) (← links)
- Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\) (Q764326) (← links)
- \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) (Q859979) (← links)
- \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP (Q908700) (← links)
- New developments in structural complexity theory (Q913509) (← links)
- Downward translations of equality (Q914368) (← links)
- A measure of relativized space which is faithful with respect to depth (Q1115190) (← links)
- Space bounded computations: Review and new separation results (Q1176238) (← links)
- Separating complexity classes with tally oracles (Q1185002) (← links)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- Circuit depth relative to a random oracle (Q1198081) (← links)
- Circuit size relative to pseudorandom oracles (Q1208410) (← links)
- Relating polynomial time to constant depth (Q1274992) (← links)
- A note on the density of oracle decreasing time-space complexity (Q1334680) (← links)
- A general method to construct oracles realizing given relationships between complexity classes (Q1351504) (← links)
- Expressing uniformity via oracles (Q1361886) (← links)
- On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- Circuits over PP and PL (Q1567408) (← links)
- Sparse selfreducible sets and nonuniform lower bounds (Q1755786) (← links)
- Relativizing relativized computations (Q1822968) (← links)
- The complexity of planarity testing (Q1887150) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- A note on the circuit complexity of PP (Q2576885) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- RelativizedNC (Q3763591) (← links)
- New collapse consequences of NP having small circuits (Q4645178) (← links)
- On the complexity of gradient gate circuits (Q4857749) (← links)
- ON HIGHER ARTHUR-MERLIN CLASSES (Q5696962) (← links)
- On pseudorandomness and resource-bounded measure (Q5941070) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
