Gröbner bases for Boolean function minimization

DOI10.1007/S11786-025-00602-8MaRDI QIDQ6918458zbMATH OpenFDO

Authors Nicolas Faroß, Simon Schwarz

Publication date 10 October 2025

Published in Mathematics in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11786-025-00602-8

zbMATH Keywords

Boolean function synthesisGröbner basesmulti-level logic optimization

Mathematics Subject Classification ID

Logic in computer science (03B70) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cites work

• A Gröbner Basis Approach to CNF-Formulae Preprocessing
• scientific article; zbMATH DE number 3876580 (Why is no real title available?)
• scientific article; zbMATH DE number 3902554 (Why is no real title available?)
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 1515218 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• Incremental column-wise verification of arithmetic circuits using computer algebra
• On Gröbner bases in the context of satisfiability-modulo-theories solving over the real numbers
• SMT solving over finite field arithmetic
• The Complexity of Boolean Formula Minimization
• The Problem of Simplifying Truth Functions
• What's hard about Boolean functional synthesis?

This page was built for publication: Gröbner bases for Boolean function minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6918458)