Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics (Q6203476)

From MaRDI portal
Revision as of 23:11, 30 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7810342
Language Label Description Also known as
English
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics
scientific article; zbMATH DE number 7810342

    Statements

    Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics (English)
    0 references
    0 references
    0 references
    0 references
    28 February 2024
    0 references
    spin glasses
    0 references
    maximum independent set
    0 references
    random graphs
    0 references
    random optimization problems
    0 references
    average-case hardness
    0 references
    Boolean circuits
    0 references
    low-degree methods
    0 references
    Langevin dynamics
    0 references
    overlap gap property
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references