On approximation by ⊕-OBDDs

Authors:
Henrik Brosenne;Carsten Damm;Matthias Homeister;Stephan Waack
Affiliations:
Institut für Informatik, Universität Göttingen, D-37073 Göttingen, Germany;Institut für Informatik, Universität Göttingen, D-37073 Göttingen, Germany;Institut für Informatik, Universität Göttingen, D-37073 Göttingen, Germany;Institut für Informatik, Universität Göttingen, D-37073 Göttingen, Germany
Venue:
Information Processing Letters
Year:
2007

Citing 5
Cited 0

On oblivious branching programs of linear length

Information and Computation
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
On arithmetic branching programs

Journal of Computer and System Sciences
Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
On relations between counting communication complexity classes

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.