Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Minimum \(\varepsilon\)-equivalent circuit size problem

From MaRDI portal
Publication:1777423
Jump to:navigation, search

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


zbMATH Keywords

combinatorial optimizationapproximationinapproximabilityBoolean circuitsnatural propertiesminimum circuit size problem


Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)


Related Items (1)

CIRCUIT INTEGRATION THROUGH LATTICE HYPERTERMS




This page was built for publication: Minimum \(\varepsilon\)-equivalent circuit size problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1777423&oldid=14122706"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 08:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki