On the hardness of approximating shortest integer relations among rational numbers (Q1274930): Difference between revisions

@@ Property / cites work @@
+The complexity and approximability of finding maximum feasible subsystems of linear relations
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate solution of NP optimization problems
@@ Property / cites work: Approximate solution of NP optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the limits of computations with the floor function
+Normal rank
@@ Property / cites work @@
+Q4234094
@@ Property / cites work: Q4234094 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Aggregation of Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Simultaneous Diophantine Approximation Problems
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234093
@@ Property / cites work: Q4234093 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4095873
@@ Property / cites work: Q4095873 / rank @@
+Normal rank