Pages that link to "Item:Q1117696"
From MaRDI portal
The following pages link to Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) (Q1117696):
Displayed 20 items.
- On learning width two branching programs (Q293246) (← links)
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
- Comments on ``Arithmetic complexity, Kleene closure, and formal power series'' (Q372962) (← links)
- Linear circuits, two-variable logic and weakly blocked monoids (Q391307) (← links)
- Length of polynomials over finite groups (Q494061) (← links)
- Leaf languages and string compression (Q550251) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Optimal advice (Q672755) (← links)
- Knapsack problems for NL (Q673615) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- Towards optimal simulations of formulas by bounded-width programs (Q685723) (← links)
- On the correlation between parity and modular polynomials (Q692898) (← links)
- First-order logics: some characterizations and closure properties (Q715044) (← links)
- The algebraic theory of Parikh automata (Q722218) (← links)
- A moderately exponential time algorithm for \(k\)-IBDD satisfiability (Q722517) (← links)
- Planar and grid graph reachability problems (Q733742) (← links)
- Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\) (Q764326) (← links)
- Non-uniform automata over groups (Q804303) (← links)