A simpler counterexample to a long-standing conjecture on the complexity of Bryantʼs apply algorithm

In 1986 in his seminal paper Bryant has introduced Ordered Binary Decision Diagrams (OBDDs) as a dynamic data structure for the representation and manipulation of Boolean functions which allow efficient algorithms for important operations like synthesis, the combination of two Boolean functions by a...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information processing letters Ročník 114; číslo 3; s. 124 - 129
Hlavný autor:	Bollig, Beate
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.03.2014 Elsevier Sequoia S.A
Predmet:	Algorithms Analysis of algorithms Boolean Boolean functions Computational complexity Computer science Data processing Input output Mathematical functions Operators Order disorder Ordered binary decision diagrams Representations Stands Studies Synthesis Ordered binary decision diagrams Analysis of algorithms Computational complexity
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!