A decidable characterization of the classes between lintime and exptime (Q1045888): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.09.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2065556835
@@ Property / OpenAlex ID: W2065556835 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4850544
@@ Property / cites work: Q4850544 / rank @@
+Normal rank
@@ Property / cites work @@
+A new recursion-theoretic characterization of the polytime functions
+Normal rank
@@ Property / cites work @@
+SAFE TURING MACHINES, GRZEGORCZYK CLASSES AND POLYTIME
+Normal rank
@@ Property / cites work @@
+A predicative and decidable characterization of the polynomial classes of languages
+Normal rank
@@ Property / cites work @@
+A predicative approach to the classification problem
+Normal rank
@@ Property / cites work @@
+Q4215632
@@ Property / cites work: Q4215632 / rank @@
+Normal rank
@@ Property / cites work @@
+A foundational delineation of poly-time
@@ Property / cites work: A foundational delineation of poly-time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4850553
@@ Property / cites work: Q4850553 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474861
@@ Property / cites work: Q4474861 / rank @@
+Normal rank