Complete problems for deterministic polynomial time (Q1235982): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(76)90068-2
+Normal rank
@@ Property / OpenAlex ID @@
+W1999647826
@@ Property / OpenAlex ID: W1999647826 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5679729
@@ Property / cites work: Q5679729 / 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 @@
+An observation on time-storage trade off
@@ Property / cites work: An observation on time-storage trade off / rank @@
+Normal rank
@@ Property / cites work @@
+Unit Refutations and Horn Sets
@@ Property / cites work: Unit Refutations and Horn Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition and parsing of context-free languages in time n3
+Normal rank