Short propositional formulas represent nondeterministic computations (Q1096390): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(88)90152-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2117427692
@@ Property / OpenAlex ID: W2117427692 / 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 @@
+Q3780445
@@ Property / cites work: Q3780445 / rank @@
+Normal rank
@@ Property / cites work @@
+Relations Among Complexity Measures
@@ Property / cites work: Relations Among Complexity Measures / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability Is Quasilinear Complete in NQL
@@ Property / cites work: Satisfiability Is Quasilinear Complete in NQL / rank @@
+Normal rank
@@ Property / cites work @@
+Q3742714
@@ Property / cites work: Q3742714 / rank @@
+Normal rank