On approximability of Boolean formula minimization (Q1768604)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2146080
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On approximability of Boolean formula minimization |
scientific article; zbMATH DE number 2146080 |
Statements
On approximability of Boolean formula minimization (English)
0 references
15 March 2005
0 references
minimum formula size problem
0 references
minimum circuit size problem
0 references
approximation
0 references
Boolean circuits
0 references
Boolean formulas
0 references
inapproximability
0 references
combinatorial optimization
0 references
0.8504273295402527
0 references
0.7996371388435364
0 references
0.7944787740707397
0 references
0.7932977080345154
0 references
0.7790232300758362
0 references
