Lucas Slot

Orcid: 0000-0003-3790-492X

According to our database1, Lucas Slot authored at least 18 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank.
CoRR, May, 2026

Agnostic learning in (almost) optimal time via Gaussian surface area.
CoRR, March, 2026

A Christoffel-like function for high-dimensional support inference in graphical models.
J. Approx. Theory, 2026

Hesse's Redemption: Efficient Convex Polynomial Programming.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Robustness of Persistent Topological Features and Minimum Homological Cuts.
Proceedings of the 42nd International Symposium on Computational Geometry, 2026

2025
Low degree conjecture implies sharp computational thresholds in stochastic block model.
CoRR, February, 2025

Computational Complexity of Sum-of-Squares Bounds for Copositive Programs.
SIAM J. Optim., 2025

Low-degree evidence for computational transition of recovery rate in stochastic block model.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

2024
Degree Bounds for Putinar's Positivstellensatz on the Hypercube.
SIAM J. Appl. Algebra Geom., March, 2024

Testably Learning Polynomial Threshold Functions.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

2023
A Recursive Theta Body for Hypergraphs.
Comb., October, 2023

An effective version of Schmüdgen's Positivstellensatz for the hypercube.
Optim. Lett., April, 2023

A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

The Christoffel-Darboux Kernel for Topological Data Analysis.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel-Darboux Kernel.
SIAM J. Optim., December, 2022

Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets.
Math. Program., 2022

2021
Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization.
Math. Program., 2021

Sum-of-Squares Hierarchies for Binary Polynomial Optimization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2021


  Loading...