A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach (Q3599157): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to proving upper bounds for MAX-2-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds for MAX-SAT by Clause Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds for Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-programming design and analysis of fast algorithms for Max 2-CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank

Latest revision as of 01:24, 29 June 2024

scientific article
Language Label Description Also known as
English
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
scientific article

    Statements

    Identifiers