scientific article; zbMATH DE number 176154

MaRDI QIDQ4035256zbMATH OpenFDO

Authors Christoph Meinel, Stephan Waack

Publication date 18 May 1993

zbMATH Keywords

lower boundsbranching programsgraph accessibility problems

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

(1)

• Separating complexity classes related to bounded alternating ?-branching programs

This page was built for publication:

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