Critical sets for Sudoku and general graph colorings (Q393178): Difference between revisions

@@ Property / OpenAlex ID @@
+W2146221204
@@ Property / OpenAlex ID: W2146221204 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0318
@@ Property / arXiv ID: 1302.0318 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A superlinear lower bound for the size of a critical set in a latin square
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+On the size of the minimum critical set of a Latin square
+Normal rank
@@ Property / cites work @@
+On the computational complexity of defining sets
@@ Property / cites work: On the computational complexity of defining sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3154457
@@ Property / cites work: Q3154457 / rank @@
+Normal rank
@@ Property / cites work @@
+Defining sets and uniqueness in graph colorings: A survey
+Normal rank
@@ Property / cites work @@
+There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
+Normal rank