The Complexity of KKT Points of Quadratic Programs with Polynomially-Bounded Coefficients
Argyrios Deligkas, Michail Fasoulakis, Stavros D. Ioannidis
Abstract
Computing a Karush-Kuhn-Tucker (KKT) point of a quadratic polynomial over the unit hypercube is known to be CLS-complete, when the coefficients of the polynomial are encoded in binary. We prove that the problem remains CLS-complete even when the coefficients are encoded in unary. This is the first problem proven to remain CLS-hard when the input is given in unary.
Create a lesson
Related papers
Semidirect sums of tensors and the matrix multiplication exponent
Baitian Li
On the Role of Geometry in Solving Variational Inequalities
Ioannis Anagnostides, Ioannis Panageas, Jingming Yan
The Complexity of ReLU Network Synthesis from a Parameter Multiset
Dimitrios Myrisiotis
A Circuit Complexity Trichotomy For Regular Languages
Stefan Göller, Amaldev Manuel
Determinant boundaries and gaps in determinantal complexity
Karthik Sheshadri
Parity Decision Trees of Depth O(4d \| f\|1) for Boolean Functions f of F2-Degree d
Shengyu Zhang