Numerical computation of characteristic polynomials of Boolean functions and its applications
From MaRDI portal
The authors develop a method of evaluation of characteristic polynomials of Boolean functions with applications to combinational circuit verification. The values of these polynomials are compared at a sample point without explicit construction. An analysis of round-off errors in floating point arithmetic is provided, including randomized algorithms [see \textit{J. T. Schwartz}, J. ACM 27, 701-717 (1980; Zbl 0452.68050)].
Recommendations
- Approximate evaluations of characteristic polynomials of Boolean functions
- On computing Boolean connectives of characteristic functions
- scientific article; zbMATH DE number 2081114
- Polynomial transformation of Boolean functions: analysis of computational algorithms
- On the polynomial form of Boolean functions: derivations and applications
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- Algebraic and combinatorial ways of computing the Möbius function and the characteristic polynomial of truncated Boolean algebras
- scientific article; zbMATH DE number 3922538
- Generalized Boole numbers and polynomials
- Numerical characteristics of DNF of partial Boolean functions
Cited in
(5)- Characterization of Boolean valued star and mega lattice functions
- Computing Boolean functions via quantum hashing
- scientific article; zbMATH DE number 4006315 (Why is no real title available?)
- On computing Boolean connectives of characteristic functions
- Approximate evaluations of characteristic polynomials of Boolean functions
This page was built for publication: Numerical computation of characteristic polynomials of Boolean functions and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264386)
