Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems (Q5172725)

From MaRDI portal
Revision as of 00:47, 2 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57534951, #quickstatements; #temporary_batch_1706826130171)
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
    0 references
    0 references
    4 February 2015
    0 references
    0 references
    0 references
    0 references
    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
    0 references