Follow
Nando Leijenhorst
Title
Cited by
Cited by
Year
Solving clustered low-rank semidefinite programs arising from polynomial optimization
N Leijenhorst, D de Laat
Mathematical Programming Computation 16 (3), 503-534, 2024
142024
Optimality and uniqueness of the D_4 root system
D de Laat, NM Leijenhorst, WHH Keizer
arXiv preprint arXiv:2404.18794, 2024
52024
Optimality of spherical codes via exact semidefinite programming bounds
H Cohn, D de Laat, N Leijenhorst
arXiv preprint arXiv:2403.16874, 2024
42024
Multiplicity of nontrivial zeros of primitive L-functions via higher-level correlations
F Gonçalves, D de Laat, N Leijenhorst
arXiv preprint arXiv:2303.01095, 2023
12023
Quantum Error Correction: Decoders for the Toric Code
N Leijenhorst
12019
Data for" Optimality of spherical codes via exact semidefinite programming bounds"
H Cohn, D de Laat, N Leijenhorst
2024
Multiplicity of nontrivial zeros of primitive 𝐿-functions via higher-level correlations
F Gonçalves, D de Laat, N Leijenhorst
Mathematics of Computation, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–7