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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters Jg. 114; H. 3; S. 124 - 129
1. Verfasser:	Bollig, Beate
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.03.2014 Elsevier Sequoia S.A
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!