scientific article; zbMATH DE number 18624

MaRDI QIDQ3976028zbMATHFDO

Authors Christoph Meinel

Publication date 26 June 1992

zbMATH Keywords

decision trees\(\Omega\)-branching programs

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 36617
• scientific article; zbMATH DE number 4172378
• Polynomial size \(\Omega\)-branching programs and their computational power
• scientific article; zbMATH DE number 4051004
• scientific article; zbMATH DE number 1759451

Cited in

(4)

• Polynomial size \(\Omega\)-branching programs and their computational power
• scientific article; zbMATH DE number 4051004 (Why is no real title available?)
• On the size of binary decision diagrams representing Boolean functions
• Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor

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 Q3976028)