Dissection with the Fewest Pieces is Hard, Even to Approximate (Q2958085): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2407252880
@@ Property / OpenAlex ID: W2407252880 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.06706
@@ Property / arXiv ID: 1512.06706 / rank @@
+Normal rank
@@ Property / cites work @@
+Meshes Preserving Minimum Feature Size
@@ Property / cites work: Meshes Preserving Minimum Feature Size / rank @@
+Normal rank
@@ Property / cites work @@
+Dissection with the Fewest Pieces is Hard, Even to Approximate
+Normal rank
@@ Property / cites work @@
+Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
+Normal rank
@@ Property / cites work @@
+Q4222032
@@ Property / cites work: Q4222032 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4548816
@@ Property / cites work: Q4548816 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Results for Multiprocessor Scheduling under Resource Constraints
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
+Normal rank