Positive versions of polynomial time (Q1281503): Difference between revisions

@@ Property / OpenAlex ID @@
+W2073674197
@@ Property / OpenAlex ID: W2073674197 / rank @@
+Normal rank
@@ Property / cites work @@
+Monotone versus positive
@@ Property / cites work: Monotone versus positive / rank @@
+Normal rank
@@ Property / cites work @@
+Q3791123
@@ Property / cites work: Q3791123 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385519
@@ Property / cites work: Q4385519 / rank @@
+Normal rank
@@ Property / cites work @@
+On Relating Time and Space to Size and Depth
@@ Property / cites work: On Relating Time and Space to Size and Depth / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+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 @@
+Q3775538
@@ Property / cites work: Q3775538 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4850061
@@ Property / cites work: Q4850061 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4843270
@@ Property / cites work: Q4843270 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4128417
@@ Property / cites work: Q4128417 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036700
@@ Property / cites work: Q4036700 / rank @@
+Normal rank
@@ Property / cites work @@
+Monotone separation of logarithmic space from logarithmic depth
+Normal rank
@@ Property / cites work @@
+Q4525283
@@ Property / cites work: Q4525283 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4346734
@@ Property / cites work: Q4346734 / rank @@
+Normal rank
@@ Property / cites work @@
+Relational queries computable in polynomial time
@@ Property / cites work: Relational queries computable in polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Languages that Capture Complexity Classes
@@ Property / cites work: Languages that Capture Complexity Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on monotone complexity of the logical permanent
+Normal rank
@@ Property / cites work @@
+Q4431372
@@ Property / cites work: Q4431372 / rank @@
+Normal rank
@@ Property / cites work @@
+Complete Problems Involving Boolean Labelled Structures and Projection Transactions
+Normal rank
@@ Property / cites work @@
+Using the Hamiltonian path operator to capture NP
@@ Property / cites work: Using the Hamiltonian path operator to capture NP / rank @@
+Normal rank
@@ Property / cites work @@
+Logical Description of Monotone NP Problems
@@ Property / cites work: Logical Description of Monotone NP Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Context-sensitive transitive closure operators
@@ Property / cites work: Context-sensitive transitive closure operators / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness of path-problems via logical reductions
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank