Inductive counting for width-restricted branching programs

DOI10.1006/INCO.1996.0084zbMath0872.68037OpenAlexW2014483498MaRDI QIDQ675225

Carsten Damm, Markus Holzer

Publication date: 6 March 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a8a6317ce33416f8eb527977b57089a88a1a951d

zbMATH Keywords

inductive counting technique

Mathematics Subject Classification ID

Related Items (5)

Uniform constant-depth threshold circuits for division and iterated multiplication. ⋮ Alternating space is closed under complement and other simulations for sublogarithmic space ⋮ Bridging across the \(\log(n)\) space frontier ⋮ A variant of inductive counting ⋮ Multi-head finite automata: Data-independent versus data-dependent computations

This page was built for publication: Inductive counting for width-restricted branching programs