Skew circuits of small width
From MaRDI portal
Publication:2173307
Recommendations
Cites work
- scientific article; zbMATH DE number 3353170 (Why is no real title available?)
- scientific article; zbMATH DE number 3197115 (Why is no real title available?)
- An impossibility gap between width-4 and width-5 permutation branching programs
- Boolean function complexity. Advances and frontiers.
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Bounds for Width Two Branching Programs
- Characterizing Valiant's algebraic complexity classes
- Circuit Definitions of Nondeterministic Complexity Classes
- Finite monoids and the fine structure of NC 1
- Log Depth Circuits for Division and Related Problems
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Non-commutative arithmetic circuits: depth reduction and size lower bounds
- Nonuniform ACC circuit lower bounds
- On Relating Time and Space to Size and Depth
- On approximate majority and probabilistic time
- Parity, circuits, and the polynomial-time hierarchy
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- Word Problems Solvable in Logspace
This page was built for publication: Skew circuits of small width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2173307)