Name
Abstract | ||
|---|---|---|
Motivated by combinational circuit verification and testing, we study the approximate evaluation of characteristic polynomials of Boolean functions. We consider an oracle model in which the values of the characteristic polynomials are approximated using the evaluations of the corresponding Boolean functions. The approximation error is defined in the worst case, average case and randomized settings. We derive lower bounds on the approximation errors in terms of the number of Boolean function evaluations. We design algorithms with an error that matches the lower bound. Let k(ε,n) denote the minimal number of Boolean function evaluations needed to reduce the initial error by a factor of ε where n is the number of Boolean variables. We show that k(ε,n) is exponential in n in the worst and average case settings, and that it is independent of n and of order ε −2 in the randomized setting. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0304-3975(00)00151-1 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
Boolean function,Complexity,approximate evaluation,Combinational circuit verification,characteristic polynomial,Testing,Characteristic polynomial | Journal | 262 |
Issue | ISSN | Citations |
1-2 | Theoretical Computer Science | 0 |
PageRank | References | Authors |
0.34 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Lee | 1 | 127 | 15.14 |
| Henryk Woźniakowski | 2 | 552 | 92.47 |