Minimum \(\varepsilon\)-equivalent circuit size problem (Q1777423)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum -equivalent circuit size problem |
scientific article; zbMATH DE number 2168211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum \(\varepsilon\)-equivalent circuit size problem |
scientific article; zbMATH DE number 2168211 |
Statements
Minimum \(\varepsilon\)-equivalent circuit size problem (English)
0 references
13 May 2005
0 references
minimum circuit size problem
0 references
approximation
0 references
Boolean circuits
0 references
inapproximability
0 references
natural properties
0 references
combinatorial optimization
0 references
0.8504273295402527
0 references
0.8126522302627563
0 references
0.7670408487319946
0 references
0.7616503238677979
0 references
