An NP-complete language accepted in linear time by a one-tape Turing machine (Q1183577): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(91)90054-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2046523441
@@ Property / OpenAlex ID: W2046523441 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4144808
@@ Property / cites work: Q4144808 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of One-Tape Turing Machine Computations
+Normal rank
@@ Property / cites work @@
+On the structure of one-tape nondeterministic Turing machine time hierarchy
+Normal rank
@@ Property / cites work @@
+Q3809270
@@ Property / cites work: Q3809270 / rank @@
+Normal rank
@@ Property / cites work @@
+On alternation
@@ Property / cites work: On alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Q5636862
@@ Property / cites work: Q5636862 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5599173
@@ Property / cites work: Q5599173 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3707407
@@ Property / cites work: Q3707407 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1183577