research
∙
05/24/2023
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
The moment-sum-of-squares (moment-SOS) hierarchy is one of the most cele...
share
research
∙
06/06/2022
New lower bounds on crossing numbers of K_m,n from permutation modules and semidefinite programming
In this paper, we use semidefinite programming and representation theory...
research
∙
01/18/2022
The maximum cardinality of trifferent codes with lengths 5 and 6
A code 𝒞⊆{0, 1, 2}^n is said to be trifferent with length n when for any...
research
∙
08/22/2018