Semidefinite resolution and exactness of semidefinite relaxations for satisfiability (Q2446872): 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.1016/j.dam.2013.06.021 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On semidefinite programming relaxations for the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved semidefinite programming relaxation for the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3515551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook on semidefinite, conic and polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results and experiments in programming techniques for propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite programming relaxations of \((2+p)\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations of the satisfiability problem using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4807964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Mathematics of Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of squares based approximation algorithms for MAX-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2013.06.021 / rank
 
Normal rank

Latest revision as of 16:55, 18 December 2024

scientific article
Language Label Description Also known as
English
Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
scientific article

    Statements

    Semidefinite resolution and exactness of semidefinite relaxations for satisfiability (English)
    0 references
    0 references
    0 references
    23 April 2014
    0 references
    satisfiability
    0 references
    resolution
    0 references
    semidefinite relaxation
    0 references

    Identifiers