Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Martino Bernasconi

Martino Bernasconi

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Algorithms×1Complexity×1Game Theory×1

Frequent co-authors

Matteo Castiglioni1×
Andrea Celli1×
Gabriele Farina1×

Research Timeline

2026
A Unifying Framework for Quasi-Polynomial Optimization of Fixed-degree Polynomials

This paper constructs an epsilon-cover of the joint value set of m constant-degree polynomials over a convex set H in the linfty-norm, with size n^(O(log(mn)/ε^2)), given that the polynomials have a constant range over the smallest l1-ball inscribing H.

Highlighted terms show continued research focus across papers

Papers

cs.DScs.CCcs.GTNEWTheoreticalJul 28, 2026

A Unifying Framework for Quasi-Polynomial Optimization of Fixed-degree Polynomials

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Gabriele Farina

This paper constructs an epsilon-cover of the joint value set of m constant-degree polynomials over a convex set H in the linfty-norm, with size n^(O(log(mn)/ε^2)), given that the polynomials have a c…

View →