A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6033497 / rank
 
Normal rank
Property / zbMATH Keywords
 
exponential-time algorithm
Property / zbMATH Keywords: exponential-time algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial space
Property / zbMATH Keywords: polynomial space / rank
 
Normal rank
Property / zbMATH Keywords
 
satisfiability
Property / zbMATH Keywords: satisfiability / rank
 
Normal rank
Property / zbMATH Keywords
 
constraint satisfaction
Property / zbMATH Keywords: constraint satisfaction / rank
 
Normal rank
Property / zbMATH Keywords
 
hybrid instances
Property / zbMATH Keywords: hybrid instances / rank
 
Normal rank
Property / zbMATH Keywords
 
measure and conquer
Property / zbMATH Keywords: measure and conquer / rank
 
Normal rank
Property / zbMATH Keywords
 
convex programming
Property / zbMATH Keywords: convex programming / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MAX-2-SAT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2011.05.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2895952552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-coloring in time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Set in Mixed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
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: A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501522 / 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: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal 2-constraint satisfaction via sum-product algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods for 3-SAT decision and worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds for Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / 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: Exact algorithms for finding minimum transversals in rank-3 hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:16, 5 July 2024

scientific article
Language Label Description Also known as
English
A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between
scientific article

    Statements

    A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (English)
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    exponential-time algorithm
    0 references
    polynomial space
    0 references
    satisfiability
    0 references
    constraint satisfaction
    0 references
    hybrid instances
    0 references
    measure and conquer
    0 references
    convex programming
    0 references
    0 references