On the power of unambiguity in log-space (Q1926109): Difference between revisions

@@ Property / DOI @@
-.1007/s00037-012-0047-3
@@ Property / DOI: 10.1007/s00037-012-0047-3 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1772007397
@@ Property / OpenAlex ID: W1772007397 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56689209
@@ Property / Wikidata QID: Q56689209 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2034
@@ Property / arXiv ID: 1001.2034 / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships among $PL$, $\#L$, and the determinant
+Normal rank
@@ Property / cites work @@
+Q3747725
@@ Property / cites work: Q3747725 / rank @@
+Normal rank
@@ Property / cites work @@
+NL-printable sets and nondeterministic Kolmogorov complexity
+Normal rank
@@ Property / cites work @@
+Planar and grid graph reachability problems
@@ Property / cites work: Planar and grid graph reachability problems / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of matrix rank and feasible systems of linear equations
+Normal rank
@@ Property / cites work @@
+Isolation, matching, and counting uniform and nonuniform upper bounds
+Normal rank
@@ Property / cites work @@
+A very hard log-space counting class
@@ Property / cites work: A very hard log-space counting class / rank @@
+Normal rank
@@ Property / cites work @@
+Directed Planar Reachability Is in Unambiguous Log-Space
+Normal rank
@@ Property / cites work @@
+Structure and importance of logspace-MOD class
@@ Property / cites work: Structure and importance of logspace-MOD class / rank @@
+Normal rank
@@ Property / cites work @@
+Using inductive counting to simulate nondeterministic computation
+Normal rank
@@ Property / cites work @@
+Q4266543
@@ Property / cites work: Q4266543 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of parity polynomial time
@@ Property / cites work: On the power of parity polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+ReachFewL = ReachUL
@@ Property / cites work: ReachFewL = ReachUL / rank @@
+Normal rank
@@ Property / cites work @@
+The strong exponential hierarchy collapses
@@ Property / cites work: The strong exponential hierarchy collapses / 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 @@
+Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case
+Normal rank
@@ Property / cites work @@
+Q5414582
@@ Property / cites work: Q5414582 / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalence of NC\(^ k\) and AC\(^{k-1}\) closures of NP and other classes
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Q3793733
@@ Property / cites work: Q3793733 / rank @@
+Normal rank
@@ Property / cites work @@
+The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
+Normal rank
@@ Property / cites work @@
+Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space
+Normal rank
@@ Property / cites work @@
+Relative complexity of checking and evaluating
@@ Property / cites work: Relative complexity of checking and evaluating / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00037-012-0047-3
@@ Property / DOI: 10.1007/S00037-012-0047-3 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1926109