scientific article; zbMATH DE number 1088264

MaRDI QIDQ4364580zbMATH OpenFDO

Authors Mitsushi Nouzoe, Y. Takenaga, S. Yajima

Publication date 4 November 1998

zbMATH Keywords

lower boundBoolean functiongraph representationordered binary decision diagramsthreshold functions

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Logic programming (68N17) Boolean functions (06E30)

Recommendations

• Size of ordered binary decision diagrams representing threshold functions
• scientific article; zbMATH DE number 1555979
• On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
• On the size of (generalized) OBDDs for threshold functions
• Variable orderings and the size of OBDDs for random partially symmetric Boolean functions

Cited in

(8)

• On the size of (generalized) OBDDs for threshold functions
• Restrictive Acceptance Suffices for Equivalence Problems
• scientific article; zbMATH DE number 1555979 (Why is no real title available?)
• On the influence of the variable ordering for algorithmic learning using OBDDs
• Size of OBDD representation of 2-level redundancies functions
• On threshold BDDs and the optimal variable ordering problem
• Output-size sensitiveness of OBDD construction through maximal independent set problem
• On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem

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