scientific article; zbMATH DE number 1555979
From MaRDI portal
Publication:4525752
zbMATH Open0953.68580MaRDI QIDQ4525752FDOQ4525752
Y. Takenaga, S. Yajima, K. Hosaka
Publication date: 24 January 2001
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 1088264
- On the size of (generalized) OBDDs for threshold functions
- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
- On the size of binary decision diagrams representing Boolean functions
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (7)
- On the Width of Ordered Binary Decision Diagrams
- On the size of binary decision diagrams representing Boolean functions
- Title not available (Why is that?)
- On the size of (generalized) OBDDs for threshold functions
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
- A relation-algebraic approach to simple games
- 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 Q4525752)
