On semidefinite least squares and minimal unsatisfiability
From MaRDI portal
Publication:516798
DOI10.1016/j.dam.2016.09.008zbMath1364.90243OpenAlexW2521729967MaRDI QIDQ516798
Manuel V. C. Vieira, Miguel F. Anjos
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.008
semidefinite programmingsatisfiabilityFarkas' lemmaminimal unsatisfiabilitysemidefinite least squares
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Handbook on semidefinite, conic and polynomial optimization
- Sums of squares based approximation algorithms for MAX-SAT
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- Using local search to find MSSes and MUSes
- Some results and experiments in programming techniques for propositional logic
- The complexity of facets resolved
- Tautologies and positive solvability of linear homogeneous systems
- Recognition of \(q\)-Horn formulae in linear time
- A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- An improved semidefinite programming relaxation for the satisfiability problem
- On exact selection of minimally unsatisfiable subformulae
- On semidefinite programming relaxations of \((2+p)\)-SAT
- Relaxations of the satisfiability problem using semidefinite programming
- On semidefinite programming relaxations for the satisfiability problem
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
- Algorithms for computing minimal unsatisfiable subsets of constraints
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
- An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Classroom Note:An Elementary Proof of Farkas' Lemma
- A Spectral Bundle Method for Semidefinite Programming
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
- Handbook of semidefinite programming. Theory, algorithms, and applications
