scientific article; zbMATH DE number 3866582

MaRDI QIDQ3334079zbMATH OpenFDO

Authors Ingo Wegener

Publication date 1984

zbMATH Keywords

decision treessymmetric Boolean functionsbranching programstime-space trade-offs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
• Lower bounds to the complexity of symmetric Boolean functions
• Time-space trade-offs for branching programs
• scientific article; zbMATH DE number 3913677
• Time-space tradeoffs for branching programs

Cited in

(4)

• Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
• Polynomial size \(\Omega\)-branching programs and their computational power
• A lower bound for read-once-only branching programs
• Totally optimal decision trees for Boolean functions

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