Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Minimization of binary decision diagrams for systems of incompletely defined Boolean functions

From MaRDI portal
Publication:2017631
Jump to:navigation, search

DOI10.1134/S106423071306004XzbMath1320.94114MaRDI QIDQ2017631

P. N. Bibilo

Publication date: 23 March 2015

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)



Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)



Uses Software

  • ModelSim


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Decomposition of systems of Boolean functions determined by binary decision diagrams
  • Software implementation of logic functions and automata. II. Computation time of binary programs
  • Ordered binary decision diagrams as knowledge-bases
  • Graph-Based Algorithms for Boolean Function Manipulation
  • A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic Circuits
  • Binary Decision Diagrams
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2017631&oldid=14482019"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 19:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki