Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounded approximation for the minimum cost 2-sat problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank

Latest revision as of 12:14, 30 May 2024

scientific article
Language Label Description Also known as
English
Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
scientific article

    Statements

    Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (English)
    0 references
    0 references
    21 August 2000
    0 references
    computational complexity
    0 references
    Boolean constraints
    0 references
    optimization problems
    0 references

    Identifiers