Author

M. Mastrolilli

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Approximating the Chv\'atal--Gomory Closure of Capacity-Bounded Min-Closed Systems

Optimizing over the {0, 1/2} rank-1 Chv\`atal-Gomory (CG) closure of a binary integer linear program is NP-hard. While polynomial-time approximation schemes (PTAS) are established for monotone packing and covering formulations, extending these guarantees to mixed-sign variants remains an open challenge. In this paper,...

Stefan Huber, M. Mastrolilli · 1 citation · ⚡1

Preprint Sep 2026

Vanishing Ideals and the Computational Tractability of Sum-of-Squares over Boolean Domains

Building on the bit-complexity framework of Raghavendra-Weitz and the moment-SOS criteria of Gribling-Polak-Slot, we study the effective use of truncated vanishing identities over Boolean polynomial systems. A complete, constructible identity space gives an augmented moment SDP that can be optimized with exact rational...

M. Mastrolilli · 2 citations · ⚡2

Preprint Sep 2026

Ideal Membership in Polynomial Calculus: Complexity and Reductions

The Ideal Membership Problem (IMP) asks whether a polynomial f belongs to an idealof Q[x_1, ..., x_n]. Polynomial Calculus (PC) certifies membership by deriving f from the generators, and a degree-d derivation needs at most n^O(d) steps. We write PC-IMPd for the problem of producing a degree-bounded PC certificate, and...

Alex Bortolotti, M. Mastrolilli · 0 citations