The following pages link to Constant Depth Reducibility (Q3325043):
Displaying 35 items.
- The complexity of planarity testing (Q1887150) (← links)
- A note on logspace optimization (Q1904668) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\) (Q2339958) (← links)
- Threshold circuits of bounded depth (Q2366275) (← links)
- Parallelizing time with polynomial circuits (Q2429726) (← links)
- A note on some languages in uniform \(ACC^ 0\) (Q2638770) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- The complexity of searching implicit graphs (Q2676567) (← links)
- Parity, circuits, and the polynomial-time hierarchy (Q3318683) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)
- Extensions of an idea of McNaughton (Q3489464) (← links)
- Parallel complexity of algebraic operations (Q4005330) (← links)
- Some results on uniform arithmetic circuit complexity (Q4285623) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- The complexity of searching succinctly represented graphs (Q4645179) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- (Q4993356) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917) (← links)
- On small depth threshold circuits (Q5056127) (← links)
- Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs (Q5089210) (← links)
- Parallel complexity of iterated morphisms and the arithmetic of small numbers (Q5096834) (← links)
- Does Looking Inside a Circuit Help (Q5111215) (← links)
- Feasible Depth (Q5425324) (← links)
- Counting classes: Thresholds, parity, mods, and fewness (Q5905584) (← links)
- A lower bound for primality (Q5943093) (← links)
- On the complexity of some problems on groups input as multiplication tables (Q5956010) (← links)
- On the coincidence of complexity classes BPC and \(\text{TC}^0 \) (Q6043894) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
- Computationally hard problems for logic programs under answer set semantics (Q6636616) (← links)
