On approximation by ⊕-OBDDs

On approximation by ⊕-OBDDs

We show that for every ∨-OBDD of quasipolynomial size there is a ⊕-OBDD of quasipolynomial size computing the same function up to a small fraction of the inputs. We also prove that the final step in the approximation cannot be improved and discuss possibilities of proving non-approximability results...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2007-04, Vol.102 (1), p.17-21
Hauptverfasser: Brosenne, Henrik, Damm, Carsten, Homeister, Matthias, Waack, Stephan
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Approximation
Computational complexity
Computer science
control theory
systems
Exact sciences and technology
Information processing
Mathematics
Matrix
Nondeterministic OBDD
Numerical analysis
Numerical analysis. Scientific computation
Numerical approximation
Parity OBDD
Polynomials
Sciences and techniques of general use
Studies
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We show that for every ∨-OBDD of quasipolynomial size there is a ⊕-OBDD of quasipolynomial size computing the same function up to a small fraction of the inputs. We also prove that the final step in the approximation cannot be improved and discuss possibilities of proving non-approximability results and connections to lower bounds on matrix rigidity.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2006.10.011