3 papers
cs.AI2026
How Much Can a Few Engine Moves Help? Quantifying Limited Cheating in Chess
Daniel Keren
Cheating in chess, by using advice from powerful software, has become a major problem, reaching the highest levels. As opposed to the large majority of previous work, which concern…
math.OC2024
A practical, fast method for solving sum-of-squares problems for very large polynomials
Daniel Keren, Margarita Osadchy, Roi Poranne
Sum of squares (SOS) optimization is a powerful technique for solving problems where the positivity of a polynomials must be enforced. The common approach to solve an SOS problem i…
cs.DS2023
Geometric Covering using Random Fields
Felipe Goncalves, Daniel Keren, Amit Shahar +1
A set of vectors is -clusterable if there are balls of radius that cover . A set of vectors $S \subseteq \mathb…