On semidefinite least squares and minimal unsatisfiability
type: Item
instance of: scholarly article
title: On semidefinite least squares and minimal unsatisfiability
zbMATH Open document ID: 1364.90243
author: Miguel F. Anjos
author: Manuel V. C. Vieira
published in: Discrete Applied Mathematics
publication date: 2017-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6695017
zbMATH Keywords: semidefinite programming
zbMATH Keywords: satisfiability
zbMATH Keywords: minimal unsatisfiability
zbMATH Keywords: Farkas' lemma
zbMATH Keywords: semidefinite least squares
MaRDI profile type: Publication
full work available at URL: j.dam.2016.09.008
OpenAlex ID: W2521729967
cites work: On semidefinite programming relaxations for the satisfiability problem
cites work: An improved semidefinite programming relaxation for the satisfiability problem
cites work: An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
cites work: Q3515551
cites work: Q3109951
cites work: Handbook on semidefinite, conic and polynomial optimization
cites work: Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
cites work: Q5503674
cites work: Some results and experiments in programming techniques for propositional logic
cites work: Recognition of \(q\)-Horn formulae in linear time
cites work: Q4821526
cites work: On exact selection of minimally unsatisfiable subformulae
cites work: Q4255462
cites work: Tautologies and positive solvability of linear homogeneous systems
cites work: Classroom Note:An Elementary Proof of Farkas' Lemma
cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications
cites work: On semidefinite programming relaxations of \((2+p)\)-SAT
cites work: Relaxations of the satisfiability problem using semidefinite programming
cites work: How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Using local search to find MSSes and MUSes
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
cites work: Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
cites work: An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
cites work: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
cites work: Theory and Applications of Satisfiability Testing
cites work: Algorithms for computing minimal unsatisfiable subsets of constraints
cites work: A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
cites work: The complexity of facets resolved
cites work: Sums of squares based approximation algorithms for MAX-SAT
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
DOI: 10.1016/J.DAM.2016.09.008
description: scientific article; zbMATH DE number 6695017