Tailoring recursion for complexity (Q4858828): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.2307/2275767
@@ Property / full work available at URL: https://doi.org/10.2307/2275767 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2089982125
@@ Property / OpenAlex ID: W2089982125 / rank @@
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank
@@ Property / cites work @@
+Fixed-point extensions of first-order logic
@@ Property / cites work: Fixed-point extensions of first-order logic / rank @@
+Normal rank
@@ Property / cites work @@
+A logic for constant-depth circuits
@@ Property / cites work: A logic for constant-depth circuits / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of optimization problems
@@ Property / cites work: The complexity of optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+An algebra and a logic for \(NC^ 1\)
@@ Property / cites work: An algebra and a logic for \(NC^ 1\) / rank @@
+Normal rank
@@ Property / cites work @@
+Weak Second‐Order Arithmetic and Finite Automata
+Normal rank
@@ Property / cites work @@
+Datalog extensions for database queries and updates
+Normal rank
@@ Property / cites work @@
+Languages that Capture Complexity Classes
@@ Property / cites work: Languages that Capture Complexity Classes / 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 @@
+Upper and lower bounds for first order expressibility
+Normal rank
@@ Property / cites work @@
+Capturing complexity classes by fragments of second-order logic
+Normal rank