Numerical computation of characteristic polynomials of Boolean functions and its applications

DOI10.1023/A:1016632423579MaRDI QIDQ1264386zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 29 September 1998

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1016632423579

zbMATH Keywords

randomized algorithmsBoolean functionsround-off errorsfloating point arithmeticcombinational circuit verificationevaluation of characteristic polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Boolean functions (06E30)

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
• scientific article; zbMATH DE number 4006315 (Why is no real title available?)
• Approximate evaluations of characteristic polynomials of Boolean functions
• On computing Boolean connectives of characteristic functions
• Computing Boolean functions via quantum hashing

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)