Incremental Branching Programs

DOI10.1007/11753728_20MaRDI QIDQ3434693zbMATH OpenOpenAlexFDO

Authors Anna Gál, Michal Koucký, Pierre McKenzie

Publication date 2 May 2007

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

GEN problems

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Incremental branching programs
• scientific article; zbMATH DE number 17817
• A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs
• scientific article; zbMATH DE number 1361505
• The power of nondeterminism in polynomial-size bounded-width branching programs

Cited in

(3)

• scientific article; zbMATH DE number 17817 (Why is no real title available?)
• Incremental branching programs
• scientific article; zbMATH DE number 1881085 (Why is no real title available?)

This page was built for publication: Incremental Branching Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434693)