1 citations · 1 across the 2 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.NT2020
Primes in arithmetic progressions and semidefinite programming
Andrés Chirre, Valdir José Pereira Júnior, David de Laat
Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed…
math.OC2020
Exact semidefinite programming bounds for packing problems
Maria Dostert, David de Laat, Philippe Moustrou
In this paper we give an algorithm to round the floating point output of a semidefinite programming solver to a solution over the rationals or a quadratic extension of the rational…