Upper and lower bounds for certain graph-accessibility-problems on bounded alternating -branching programs

DOI10.1007/3-540-54345-7_77MaRDI QIDQ4035256zbMATH OpenFDO

Authors Christoph Meinel, Stephan Waack

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54345-7_77

zbMATH Keywords

branching programsgraph accessibility problemslower bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 512807
• scientific article; zbMATH DE number 36617
• Separating complexity classes related to bounded alternating ?-branching programs
• scientific article; zbMATH DE number 3913677
• Polynomial size \(\Omega\)-branching programs and their computational power

Cited in

(2)

• scientific article; zbMATH DE number 512807 (Why is no real title available?)
• Separating complexity classes related to bounded alternating ?-branching programs

This page was built for publication: Upper and lower bounds for certain graph-accessibility-problems on bounded alternating \(\omega\)-branching programs

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