SOS Is Not Obviously Automatizable, Even Approximately (Q4638114): Difference between revisions

@@ label / en / label / en @@
+SOS Is Not Obviously Automatizable, Even Approximately
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Sum-of-squares proofs and the quest toward optimal algorithms
+Normal rank
@@ Property / cites work @@
+Laplacian eigenvalues and the maximum cut problem
@@ Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Systems of distinct representatives and linear algebra
+Normal rank
@@ Property / cites work @@
+Complexity of Positivstellensatz proofs for the knapsack
+Normal rank
@@ Property / cites work @@
+Complexity of Null- and Positivstellensatz proofs
@@ Property / cites work: Complexity of Null- and Positivstellensatz proofs / rank @@
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING
+Normal rank
@@ Property / cites work @@
+Strong duality in lasserre's hierarchy for polynomial optimization
+Normal rank
@@ Property / cites work @@
+Hypercontractive inequalities via SOS, and the Frankl--Rödl graph
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms in linear programming
@@ Property / cites work: Polynomial algorithms in linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Optimisation globale et théorie des moments
@@ Property / cites work: Optimisation globale et théorie des moments / rank @@
+Normal rank
@@ Property / cites work @@
+Global Optimization with Polynomials and the Problem of Moments
+Normal rank
@@ Property / cites work @@
+Q3601990
@@ Property / cites work: Q3601990 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4407449
@@ Property / cites work: Q4407449 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4496025
@@ Property / cites work: Q4496025 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability and proof complexity
@@ Property / cites work: Approximability and proof complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of semidefinite programs
@@ Property / cites work: On the complexity of semidefinite programs / rank @@
+Normal rank
@@ Property / cites work @@
+An exact duality theory for semidefinite programming and its complexity implications
+Normal rank
@@ Property / cites work @@
+Sums of squares of polynomials with rational coefficients
+Normal rank
@@ Property / cites work @@
+Class of global minimum bounds of polynomial functions
+Normal rank
@@ Property / cites work @@
+Semidefinite programming and arithmetic circuit evaluation
+Normal rank
@@ Property / full work available at URL @@
+https://drops.dagstuhl.de/opus/volltexte/2017/8198/pdf/LIPIcs-ITCS-2017-59.pdf/
+Normal rank
@@ Property / OpenAlex ID @@
+W2773609948
@@ Property / OpenAlex ID: W2773609948 / rank @@
+Normal rank
@@ Property / title @@
+SOS Is Not Obviously Automatizable, Even Approximately (English)
+Normal rank