On approximability of Boolean formula minimization

DOI10.1023/B:JOCO.0000031414.39556.3AzbMath1088.68071OpenAlexW2085991408MaRDI QIDQ1768604

Oleg A. Prokopyev, Panos M. Pardalos

Publication date: 15 March 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:joco.0000031414.39556.3a

zbMATH Keywords

combinatorial optimizationapproximationinapproximabilityBoolean circuitsBoolean formulasminimum circuit size problemminimum formula size problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Boolean query optimization and the 0-1 hyperbolic sum problem

This page was built for publication: On approximability of Boolean formula minimization