On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10601-012-9128-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2046346504
@@ Property / OpenAlex ID: W2046346504 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5715725
@@ Property / cites work: Q5715725 / rank @@
+Normal rank
@@ Property / cites work @@
+The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
+Normal rank
@@ Property / cites work @@
+Q2784326
@@ Property / cites work: Q2784326 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Power of k-Consistency
@@ Property / cites work: On the Power of k-Consistency / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetry definitions for constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3429154
@@ Property / cites work: Q3429154 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3429155
@@ Property / cites work: Q3429155 / rank @@
+Normal rank
@@ Property / cites work @@
+Determining computational complexity from characteristic ‘phase transitions’
+Normal rank
@@ Property / cites work @@
+Tetravex is NP-complete
@@ Property / cites work: Tetravex is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4954175
@@ Property / cites work: Q4954175 / rank @@
+Normal rank