Hard problems that quickly become very easy (Q2059897): Difference between revisions

@@ Property / cites work @@
+Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
+Normal rank
@@ Property / cites work @@
+A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
+Normal rank
@@ Property / cites work @@
+Q4083461
@@ Property / cites work: Q4083461 / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring H-free graphs of bounded diameter.
@@ Property / cites work: Colouring H-free graphs of bounded diameter. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank