The Complexity of SPP Formula Minimization

DOI10.1007/978-3-540-92182-0_52MaRDI QIDQ3596751zbMATH OpenOpenAlexFDO

Authors David Buchfuhrer

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_52

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of Boolean formula minimization
• The Complexity of Boolean Formula Minimization
• The Minimization Problem for Boolean Formulas
• Two-level logic minimization: an overview
• scientific article; zbMATH DE number 1962894

Cited in

(2)

• The complexity of Boolean formula minimization
• The Complexity of Boolean Formula Minimization

This page was built for publication: The Complexity of SPP Formula Minimization

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