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ženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 114; číslo 3; s. 124 - 129
Hlavní autor: Bollig, Beate
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.03.2014
Elsevier Sequoia S.A
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 Boolean operator, and equivalence checking. Based on his empirical evaluation he has conjectured that his apply algorithm for the synthesis works in linear time with respect to the input and output size. Recently in 2012, Yoshinaka et al. have presented a counterexample which contradicts this conjecture but their example has the drawback that the chosen variable ordering for the OBDD representation of the input and output is bad. Therefore, they have raised the question whether Bryantʼs conjecture may still stand for reasonable variable orderings. Here, a negative answer is given by presenting a simple counterexample which works for such kind of variable orderings. •Bryant (1986) introduced OBDDs as a data structure for Boolean functions.•Synthesis is a key operation for the manipulation of Boolean functions.•Bryant conjectured that his apply procedure for synthesis works in linear time with respect to input and output size.•Yoshinaka et al. (2012) presented a counterexample which works for a bad variable ordering.•Here we present a simpler counterexample that works for very good variable orderings.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2013.11.003