| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429221 | Information Processing Letters | 2007 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
