Minimum \(\varepsilon\)-equivalent circuit size problem
From MaRDI portal
Publication:1777423
DOI10.1007/s10878-004-4839-5zbMath1079.90114OpenAlexW2007873581MaRDI QIDQ1777423
Oleg A. Prokopyev, Panos M. Pardalos
Publication date: 13 May 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-004-4839-5
combinatorial optimizationapproximationinapproximabilityBoolean circuitsnatural propertiesminimum circuit size problem
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (1)
This page was built for publication: Minimum \(\varepsilon\)-equivalent circuit size problem