Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
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 / cites work
 
Property / cites work: Q4952605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, languages and programming. 26th international colloquium, ICALP `99. Prague, Czech Republic, July 11--15, 1999. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fixed-parameter tractability and approximability of NP optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAX SAT approximation beyond the limits of polynomial-time approximation / 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: Q2754147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New worst-case upper bounds for SAT / 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: Parameterizing above Guaranteed Values: MaxSat and MaxCut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving satisfiability in less than \(2^ n\) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds for Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved exponential-time algorithm for <i>k</i> -SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete MAXSAT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Maximum Satisfiability / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(02)00402-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036185701 / rank
 
Normal rank

Latest revision as of 10:55, 30 July 2024

scientific article
Language Label Description Also known as
English
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
scientific article

    Statements

    Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 September 2003
    0 references
    maximum cut problem
    0 references

    Identifiers