Q5020650 (Q5020650): Difference between revisions

@@ Property / cites work @@
+Some Programming Languages for Logspace and Ptime
@@ Property / cites work: Some Programming Languages for Logspace and Ptime / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+Theory of program structures: Schemes, semantics, verification
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+Q4265595
@@ Property / cites work: Q4265595 / rank @@
+Normal rank
@@ Property / cites work @@
+LOGSPACE and PTIME characterized by programming languages
+Normal rank
@@ Property / cites work @@
+The expressive power of higher-order types or, life without CONS
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+The Power of Non-determinism in Higher-Order Implicit Complexity
+Normal rank
@@ Property / cites work @@
+Classes of languages and linear-bounded automata
@@ Property / cites work: Classes of languages and linear-bounded automata / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive functions of symbolic expressions and their computation by machine, Part I
+Normal rank
@@ Property / cites work @@
+Abstract Recursion and Intrinsic Complexity
@@ Property / cites work: Abstract Recursion and Intrinsic Complexity / 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
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank
@@ Property / cites work @@
+On Computable Numbers, with an Application to the Entscheidungsproblem
+Normal rank