Non deterministic polynomial optimization problems and their approximations (Q1152215): Difference between revisions

@@ Property / cites work @@
+On the computational power of pushdown automata
@@ Property / cites work: On the computational power of pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198057
@@ Property / cites work: Q4198057 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4161330
@@ Property / cites work: Q4161330 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Near-Optimal Graph Coloring
@@ Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Q4077442
@@ Property / cites work: Q4077442 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+General approximation algorithms for some arithmetical combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q4125769
@@ Property / cites work: Q4125769 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146536
@@ Property / cites work: Q4146536 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4164569
@@ Property / cites work: Q4164569 / rank @@
+Normal rank
@@ Property / cites work @@
+Computationally Related Problems
@@ Property / cites work: Computationally Related Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Problems: Reductibility and Approximation
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Problems: Reductibility and Approximation
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+A Fast Monte-Carlo Test for Primality
@@ Property / cites work: A Fast Monte-Carlo Test for Primality / rank @@
+Normal rank