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

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 114; no. 3; pp. 124 - 129
Main Author:	Bollig, Beate
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.03.2014 Elsevier Sequoia S.A
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!