Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (Q5139600): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3108156473 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1907.01218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Local Search by Quantum Arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Boolean constraint satisfaction local search problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Theory of Complexity for Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steepest ascent can be exponential in bounded treewidth problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The peaks and geometry of fitness landscapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of conservative valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local optimization on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Nodes of Degree Four in the Local Max-Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Perturbation Strength Shapes the Global Structure of TSP Fitness Landscapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reciprocal sign epistasis is a necessary condition for multi-peaked fitness landscapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Local Search Problems that are Hard to Solve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary Conditions for Tractability of Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finite-Valued CSPs / rank
 
Normal rank

Latest revision as of 04:38, 24 July 2024

scientific article; zbMATH DE number 7283372
Language Label Description Also known as
English
Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search
scientific article; zbMATH DE number 7283372

    Statements

    Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2020
    0 references
    constraint satisfaction
    0 references
    search
    0 references
    mathematical foundations
    0 references

    Identifiers

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