Minimum \(\varepsilon\)-equivalent circuit size problem
From MaRDI portal
Publication:1777423
DOI10.1007/s10878-004-4839-5zbMath1079.90114MaRDI 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 optimization; approximation; inapproximability; Boolean circuits; natural properties; minimum circuit size problem
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
Related Items