A new recursion-theoretic characterization of the polytime functions (Q1207333): Difference between revisions

@@ Property / author @@
+Stephen J. Bellantoni
@@ Property / author: Stephen J. Bellantoni / rank @@
+Normal rank
@@ Property / author @@
+Stephen A. Cook
@@ Property / author: Stephen A. Cook / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetizing uniform \(NC\)
@@ Property / cites work: Arithmetizing uniform \(NC\) / rank @@
+Normal rank
@@ Property / cites work @@
+A new recursion-theoretic characterization of the polytime functions
+Normal rank
@@ Property / cites work @@
+Q3757904
@@ Property / cites work: Q3757904 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133141
@@ Property / cites work: Q4133141 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4010352
@@ Property / cites work: Q4010352 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035304
@@ Property / cites work: Q4035304 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4264731
@@ Property / cites work: Q4264731 / 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 @@
+Q4035315
@@ Property / cites work: Q4035315 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3325707
@@ Property / cites work: Q3325707 / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of Predictably Computable Functions
@@ Property / cites work: Classes of Predictably Computable Functions / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01201998
+Normal rank
@@ Property / OpenAlex ID @@
+W2069792094
@@ Property / OpenAlex ID: W2069792094 / rank @@
+Normal rank