Approximate evaluations of characteristic polynomials of Boolean functions
From MaRDI portal
Publication:5958111
DOI10.1016/S0304-3975(00)00151-1zbMath1012.94026OpenAlexW1995926284MaRDI QIDQ5958111
No author found.
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00151-1
complexitycharacteristic polynomialBoolean functioncircuit testingcombinatorial circuit verification
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arithmetization: A new method in structural complexity theory
- Stochastic properties of quadrature formulas
- Randomization for continuous problems
- Numerical computation of characteristic polynomials of Boolean functions and its applications
- Representing Boolean functions as polynomials modulo composite numbers
- Information of varying cardinality
- The optimal error of Monte Carlo integration
- Reconstructing Algebraic Functions from Mixed Data
- IP = PSPACE
- Robust Characterizations of Polynomials with Applications to Program Testing
- The complexity of theorem-proving procedures
This page was built for publication: Approximate evaluations of characteristic polynomials of Boolean functions
