scientific article; zbMATH DE number 1088264
From MaRDI portal
Publication:4364580
zbMATH Open0898.94020MaRDI QIDQ4364580FDOQ4364580
S. Yajima, Mitsushi Nouzoe, Y. Takenaga
Publication date: 4 November 1998
Title of this publication is not available (Why is that?)
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
Computer science aspects of computer-aided design (68U07) Logic programming (68N17) Boolean functions (06E30)
Cited In (8)
- On the influence of the variable ordering for algorithmic learning using OBDDs
- Size of OBDD representation of 2-level redundancies functions
- Output-size sensitiveness of OBDD construction through maximal independent set problem
- On threshold BDDs and the optimal variable ordering problem
- On the size of (generalized) OBDDs for threshold functions
- Restrictive Acceptance Suffices for Equivalence Problems
- Title not available (Why is that?)
- 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)
