Treffer: Bdds-design, analysis, complexity, and applications
Title:
Bdds-design, analysis, complexity, and applications
Authors:
Source:
Optimal Discrete Structures and Algorithms (ODSA 2000), Rostock, Germany, September 11-13, 2000Discrete applied mathematics. 138(1-2):229-251
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 2004.
Publication Year:
2004
Physical Description:
print, 41 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Plans d'expériences et configurations, Designs and configurations, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Analyse algorithme, Algorithm analysis, Análisis algoritmo, Borne inférieure, Lower bound, Cota inferior, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Conception, Design, Diseño, Diagramme binaire décision, Binary decision diagram, Diagrama binaria decisión, Fonction booléenne, Boolean function, Función booliana, Informatique théorique, Computer theory, Informática teórica, Optimisation, Optimization, Optimización, Représentation fonction, Function representation, Representación función, Structure donnée, Data structure, Estructura datos, Théorie algorithme, Algorithm theory, 05Bxx, 68R10, Algorithme combinatoire
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Fachbereich Informatik LS 2, University Dortmund, 44221 Dortmund, Germany
ISSN:
0166-218X
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.15555992
Database:
PASCAL Archive
Weitere Informationen
BDDs (binary decision diagrams) and their variants are the most frequently used representation types or data structures for boolean functions. Research on BDD variants has turned out to be one of the areas where the symbiosis between theoretical investigations in algorithm design and analysis, complexity theory, and applications has led to progress in theory and in applications. Here the different roots of the interest in BDDs are described, the main BDD variants and their algorithmic properties are presented, the representation size of selected functions is investigated, lower bound techniques are discussed and applications to algorithmic graph problems and hardware verification problems are presented.