The following pages link to Constant Depth Reducibility (Q3325043):
Displaying 50 items.
- Correctness of linear logic proof structures is NL-complete (Q534703) (← links)
- The isomorphism conjecture for constant depth reductions (Q619896) (← links)
- The expressiveness of a family of finite set languages (Q672126) (← links)
- On adaptive DLOGTIME and POLYLOGTIME reductions (Q672322) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- On the power of small-depth threshold circuits (Q685717) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- The exact complexity of projective image matching (Q736619) (← links)
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- Non-uniform automata over groups (Q804303) (← links)
- The parallel complexity of two problems on concurrency (Q811123) (← links)
- The binary network flow problem is logspace complete for P (Q914388) (← links)
- Polynomial size \(\Omega\)-branching programs and their computational power (Q918199) (← links)
- The complexity of propositional implication (Q989577) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
- Bounded-depth, polynomial-size circuits for symmetric functions (Q1063574) (← links)
- One-way functions and circuit complexity (Q1096587) (← links)
- Limits on the power of concurrent-write parallel machines (Q1103403) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- Efficient parallel circuits and algorithms for division (Q1114393) (← links)
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) (Q1117696) (← links)
- On the relative complexity of some languages in \(NC^ 1\) (Q1124355) (← links)
- On the computational efficiency of symmetric neural networks (Q1176243) (← links)
- Linear-size constant-depth polylog-threshold circuits (Q1182085) (← links)
- Some notes on threshold circuits, and multiplication in depth 4 (Q1182104) (← links)
- The complexity of the parity function in unbounded fan-in, unbounded depth circuits (Q1183575) (← links)
- An arithmetic model of computation equivalent to threshold circuits (Q1186610) (← links)
- Learning in parallel (Q1187024) (← links)
- The graph of multiplication is equivalent to counting (Q1190513) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- Regular languages in \(NC\) (Q1191027) (← links)
- Multiplication, division, and shift instructions in parallel random access machines (Q1193622) (← links)
- The complexity of computing symmetric functions using threshold circuits (Q1193637) (← links)
- Circuit depth relative to a random oracle (Q1198081) (← links)
- Computing with discrete multi-valued neurons (Q1201886) (← links)
- Extensions to Barrington's M-program model (Q1208406) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis (Q1288202) (← links)
- Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space (Q1318772) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- Analog computation via neural networks (Q1331940) (← links)
- On ACC (Q1346616) (← links)
- A note on neural sorting networks with O(1) time complexity (Q1352092) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Resolution of Hartmanis' conjecture for NL-hard sparse sets (Q1575434) (← links)
- A frame for general divide-and-conquer recurrences (Q1847368) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- The complexity of planarity testing (Q1887150) (← links)
