The Complexity of Boolean Formula Minimization
From MaRDI portal
Publication:3521905
DOI10.1007/978-3-540-70575-8_3zbMath1152.68445OpenAlexW1494752912WikidataQ56813874 ScholiaQ56813874MaRDI QIDQ3521905
Christopher Umans, David Buchfuhrer
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://authors.library.caltech.edu/23422/
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Fast simplifications for Tarski formulas based on monomial inequalities ⋮ Random arithmetic formulas can be reconstructed efficiently ⋮ Optimizing S-Box Implementations for Several Criteria Using SAT Solvers ⋮ CIRCUIT INTEGRATION THROUGH LATTICE HYPERTERMS ⋮ Arithmetic Expression Construction.
This page was built for publication: The Complexity of Boolean Formula Minimization
