Monomial-size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus

05/16/2021
by   Tuomas Hakoniemi, et al.
0

In this paper we consider the relationship between monomial-size and bit-complexity in Sums-of-Squares (SOS) in Polynomial Calculus Resolution over rationals (PCR/ℚ). We show that there is a set of polynomial constraints Q_n over Boolean variables that has both SOS and PCR/ℚ refutations of degree 2 and thus with only polynomially many monomials, but for which any SOS or PCR/ℚ refutation must have exponential bit-complexity, when the rational coefficients are represented with their reduced fractions written in binary.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2020

A Lower Bound for Polynomial Calculus with Extension Rule

In this paper we study an extension of the Polynomial Calculus proof sys...
research
06/29/2020

Ideal Membership Problem for Boolean Minority

The Ideal Membership Problem (IMP) tests if an input polynomial f∈𝔽[x_1,...
research
07/25/2021

Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients

Assessing non-negativity of multivariate polynomials over the reals, thr...
research
11/04/2018

Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs

We show that if a system of degree-k polynomial inequalities on n Boolea...
research
05/24/2016

Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization

Multi-homogeneous polynomial systems arise in many applications. We prov...
research
09/28/2021

Bit Complexity of Jordan Normal Form and Spectral Factorization

We study the bit complexity of two related fundamental computational pro...
research
03/16/2020

Complexity of Shapes Embedded in ℤ^n with a Bias Towards Squares

Shape complexity is a hard-to-quantify quality, mainly due to its relati...

Please sign up or login with your details

Forgot password? Click here to reset