On the Complexity of Dualization of Monotone Disjunctive Normal Forms

On the Complexity of Dualization of Monotone Disjunctive Normal Forms

We show that the duality of a pair of monotone disjunctive normal forms of sizencan be tested inno(logn)time.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of algorithms 1996-11, Vol.21 (3), p.618-628
Hauptverfasser: Fredman, Michael L., Khachiyan, Leonid
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Logical, boolean and switching functions
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We show that the duality of a pair of monotone disjunctive normal forms of sizencan be tested inno(logn)time.
ISSN:0196-6774
1090-2678
DOI:10.1006/jagm.1996.0062