Q4852904 (Q4852904): Difference between revisions

@@ Property / author @@
-William I. Gasarch
@@ Property / author: William I. Gasarch / rank @@
-Normal rank
@@ Property / author @@
+William I. Gasarch
@@ Property / author: William I. Gasarch / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Code Generation for Expressions with Common Subexpressions
+Normal rank
@@ Property / cites work @@
+Some connections between bounded query classes and non-uniform complexity.
+Normal rank
@@ Property / cites work @@
+Geometric optimization and \(D^ P\)-completeness
@@ Property / cites work: Geometric optimization and \(D^ P\)-completeness / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS
@@ Property / cites work: ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS / 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 @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+The complexity of optimization problems
@@ Property / cites work: The complexity of optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling under Precedence Constraints
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+On the complexity of unique solutions
@@ Property / cites work: On the complexity of unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets (and some facets of complexity)
+Normal rank
@@ Property / cites work @@
+NP-complete scheduling problems
@@ Property / cites work: NP-complete scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3795231
@@ Property / cites work: Q3795231 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4852904