Complexity of integer quasiconvex polynomial optimization (Q2387421): Difference between revisions

@@ Property / cites work @@
+Q4039970
@@ Property / cites work: Q4039970 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3035143
@@ Property / cites work: Q3035143 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization.
+Normal rank
@@ Property / cites work @@
+There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
+Normal rank
@@ Property / cites work @@
+Q5791470
@@ Property / cites work: Q5791470 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer optimization on convex semialgebraic sets
@@ Property / cites work: Integer optimization on convex semialgebraic sets / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring polynomials with rational coefficients
@@ Property / cites work: Factoring polynomials with rational coefficients / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+Q5603731
@@ Property / cites work: Q5603731 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4248250
@@ Property / cites work: Q4248250 / rank @@
+Normal rank