Polynomial time approximation schemes for dense instances of minimum constraint satisfaction (Q4417004)
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: Polynomial time approximation schemes for dense instances of minimum constraint satisfaction |
scientific article; zbMATH DE number 1959945
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time approximation schemes for dense instances of minimum constraint satisfaction |
scientific article; zbMATH DE number 1959945 |
Statements
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction (English)
0 references
6 August 2003
0 references
approximation algorithms
0 references
approximation ratios
0 references
polynomial time approximation schemes
0 references
minimum constraint satisfaction
0 references
nearest codeword problem
0 references
dense instances
0 references
hypergraph sampling
0 references
