A separation of syntactic and nonsyntactic \((1,+k)\)-branching programs

DOI10.1007/PL00001608zbMath0986.68031OpenAlexW2037412972MaRDI QIDQ5946705

Detlef Sieling

Publication date: 14 October 2001

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00001608

zbMATH Keywords

branching programs

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: A separation of syntactic and nonsyntactic \((1,+k)\)-branching programs