On semidefinite least squares and minimal unsatisfiability (Q516798): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On semidefinite programming relaxations for the satisfiability problem / 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: 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: Q3109951 / 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: Semidefinite resolution and exactness of semidefinite relaxations for satisfiability / 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: Recognition of \(q\)-Horn formulae in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exact selection of minimally unsatisfiable subformulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tautologies and positive solvability of linear homogeneous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classroom Note:An Elementary Proof of Farkas' Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications / 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: How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using local search to find MSSes and MUSes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel / 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: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing minimal unsatisfiable subsets of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for reducing the number of variables in MAX SAT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / 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

Latest revision as of 12:53, 13 July 2024

scientific article
Language Label Description Also known as
English
On semidefinite least squares and minimal unsatisfiability
scientific article

    Statements

    On semidefinite least squares and minimal unsatisfiability (English)
    0 references
    0 references
    0 references
    15 March 2017
    0 references
    semidefinite programming
    0 references
    satisfiability
    0 references
    minimal unsatisfiability
    0 references
    Farkas' lemma
    0 references
    semidefinite least squares
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers