summary:A well-known theorem of Rabin yields a dimensional lower bound on the width of complete polynomial proofs of a system of linear algebraic inequalities. In this note we investigate a practically motivated class of systems where the same lower bound can be obtained on the width of almost all (noncomplete) linear proofs. The proof of our result is based on the Helly Theorem
We show that if a system of degree-k polynomial constraints on n Boolean variables has a Sums-of-Squ...
We analyse how the standard reductions between constraint satisfaction problems affect their proof c...
In [2] S.P. Han proposed a method for finding a least-squares solution for systems of linear inequal...
summary:A well-known theorem of Rabin yields a dimensional lower bound on the width of complete poly...
AbstractThe main goal of this paper is to present a new algorithm bounding the regularity and “alpha...
This paper deals with systems of an arbitrary (possibly infinite) number of both weak and strict lin...
In 2003, Atserias and Dalmau resolved a major open question about the resolution proof system by est...
We show that any nonzero polynomial in the ideal generated by the $r \times r$ minors of an $n \time...
AbstractA consistency criterion for systems of linear inequalities is applied to prove an existence ...
AbstractThis paper deals with systems of an arbitrary (possibly infinite) number of both weak and st...
We study the space complexity of the cutting planes proof system, in which the lines in a proof are ...
We study the space complexity of the cutting planes proof system, in which the lines in a proof are...
AbstractWe consider a proof (more accurately, refutation) system based on the Sherali–Adams (SA) ope...
AbstractThis paper gives theorems on the dimension of solution sets of semi-infinite systems of line...
AbstractPrevious work [3, 4, 5] on solvability theorems for linear equations over cones and cones wi...
We show that if a system of degree-k polynomial constraints on n Boolean variables has a Sums-of-Squ...
We analyse how the standard reductions between constraint satisfaction problems affect their proof c...
In [2] S.P. Han proposed a method for finding a least-squares solution for systems of linear inequal...
summary:A well-known theorem of Rabin yields a dimensional lower bound on the width of complete poly...
AbstractThe main goal of this paper is to present a new algorithm bounding the regularity and “alpha...
This paper deals with systems of an arbitrary (possibly infinite) number of both weak and strict lin...
In 2003, Atserias and Dalmau resolved a major open question about the resolution proof system by est...
We show that any nonzero polynomial in the ideal generated by the $r \times r$ minors of an $n \time...
AbstractA consistency criterion for systems of linear inequalities is applied to prove an existence ...
AbstractThis paper deals with systems of an arbitrary (possibly infinite) number of both weak and st...
We study the space complexity of the cutting planes proof system, in which the lines in a proof are ...
We study the space complexity of the cutting planes proof system, in which the lines in a proof are...
AbstractWe consider a proof (more accurately, refutation) system based on the Sherali–Adams (SA) ope...
AbstractThis paper gives theorems on the dimension of solution sets of semi-infinite systems of line...
AbstractPrevious work [3, 4, 5] on solvability theorems for linear equations over cones and cones wi...
We show that if a system of degree-k polynomial constraints on n Boolean variables has a Sums-of-Squ...
We analyse how the standard reductions between constraint satisfaction problems affect their proof c...
In [2] S.P. Han proposed a method for finding a least-squares solution for systems of linear inequal...
DOI
Add to ORKG