Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems (Q5172725): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2117654132 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0811.3244 / rank | |||
Normal rank | |||
Latest revision as of 23:24, 19 April 2024
scientific article; zbMATH DE number 6397938
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems |
scientific article; zbMATH DE number 6397938 |
Statements
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems (English)
0 references
4 February 2015
0 references
Gale-Berlekamp game
0 references
approximation algorithms
0 references
correlation and hierarchical clustering
0 references
dense instances
0 references
linear time approximation schemes
0 references
minimum constraint satisfaction
0 references
nearest codeword problem
0 references
