The complexity of Boolean constraint satisfaction local search problems (Q1777392): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10472-005-0419-3 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for maximum generalized satisfiability problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of generalized satisfiability counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gadgets, Approximation, and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT local search algorithms: Worst-case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the greedy algorithm for satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding and Verifying Locally Optimal Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Local Search Problems that are Hard to Solve / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10472-005-0419-3 / rank
 
Normal rank

Latest revision as of 10:46, 11 December 2024

scientific article
Language Label Description Also known as
English
The complexity of Boolean constraint satisfaction local search problems
scientific article

    Statements

    The complexity of Boolean constraint satisfaction local search problems (English)
    0 references
    0 references
    0 references
    13 May 2005
    0 references
    satisfiability
    0 references
    local search
    0 references
    complexity
    0 references
    optimization
    0 references
    PLS
    0 references
    PLS-complete
    0 references

    Identifiers