scientific article; zbMATH DE number 1222600

MaRDI QIDQ4218142zbMATH OpenFDO

Authors Anna Slobodová

Publication date 11 November 1998

zbMATH Keywords

binary decision diagramsBoolean functioncomplexity of algorithm

Mathematics Subject Classification ID

Boolean functions (06E30) Analysis of algorithms and problem complexity (68Q25) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Improving the variable ordering of OBDDs is NP-complete
• scientific article; zbMATH DE number 1156875
• scientific article; zbMATH DE number 1555978
• On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
• Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems

Cited in

(4)

• On threshold BDDs and the optimal variable ordering problem
• A reducibility concept for problems defined in terms of ordered binary decision diagrams
• scientific article; zbMATH DE number 1555978 (Why is no real title available?)
• ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES

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