Minimum \(\varepsilon\)-equivalent circuit size problem (Q1777423): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10878-004-4839-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2007873581 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:37, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimum \(\varepsilon\)-equivalent circuit size problem |
scientific article |
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