Nontriviality for exponential time w.r.t. weak reducibilities (Q391074): Difference between revisions

@@ Property / author @@
-Ambos-Spies, Klaus
@@ Property / author: Ambos-Spies, Klaus / rank @@
-Normal rank
@@ Property / author @@
+Ambos-Spies, Klaus
@@ Property / author: Ambos-Spies, Klaus / rank @@
+Normal rank
@@ 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/j.tcs.2012.05.022
+Normal rank
@@ Property / OpenAlex ID @@
+W2139429469
@@ Property / OpenAlex ID: W2139429469 / rank @@
+Normal rank
@@ Property / cites work @@
+Nontriviality for Exponential Time w.r.t. Weak Reducibilities
+Normal rank
@@ Property / cites work @@
+Weak Completeness Notions for Exponential Time
@@ Property / cites work: Weak Completeness Notions for Exponential Time / rank @@
+Normal rank
@@ Property / cites work @@
+Comparing nontriviality for E and EXP
@@ Property / cites work: Comparing nontriviality for E and EXP / rank @@
+Normal rank
@@ Property / cites work @@
+Q4321931
@@ Property / cites work: Q4321931 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3996675
@@ Property / cites work: Q3996675 / rank @@
+Normal rank
@@ Property / cites work @@
+On 1-truth-table-hard languages
@@ Property / cites work: On 1-truth-table-hard languages / rank @@
+Normal rank
@@ Property / cites work @@
+Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
+Normal rank
@@ Property / cites work @@
+A comparison of polynomial time reducibilities
@@ Property / cites work: A comparison of polynomial time reducibilities / rank @@
+Normal rank
@@ Property / cites work @@
+Weakly Hard Problems
@@ Property / cites work: Weakly Hard Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of polynomial time completeness notions
+Normal rank