Space complexity of perfect matching in bounded genus bipartite graphs (Q439936): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 05C10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q15
@@ Property / Mathematics Subject Classification ID: 68Q15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6067703
@@ Property / zbMATH DE Number: 6067703 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+space complexity
@@ Property / zbMATH Keywords: space complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+perfect matching
@@ Property / zbMATH Keywords: perfect matching / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+topological graph theory
@@ Property / zbMATH Keywords: topological graph theory / 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.jcss.2011.11.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1496024985
@@ Property / OpenAlex ID: W1496024985 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+Making Nondeterminism Unambiguous
@@ Property / cites work: Making Nondeterminism Unambiguous / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean complexity classes vs. their arithmetic analogs
+Normal rank
@@ Property / cites work @@
+Isolation, matching, and counting uniform and nonuniform upper bounds
+Normal rank
@@ Property / cites work @@
+Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
+Normal rank
@@ Property / cites work @@
+Directed Planar Reachability Is in Unambiguous Log-Space
+Normal rank
@@ Property / cites work @@
+Deterministically isolating a perfect matching in bipartite planar graphs
+Normal rank
@@ Property / cites work @@
+Green's theorem and isolation in planar graphs
@@ Property / cites work: Green's theorem and isolation in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case
+Normal rank
@@ Property / cites work @@
+Flow in Planar Graphs with Multiple Sources and Sinks
+Normal rank
@@ Property / cites work @@
+Q5414566
@@ Property / cites work: Q5414566 / rank @@
+Normal rank
@@ Property / cites work @@
+The graph genus problem is NP-complete
@@ Property / cites work: The graph genus problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q3999514
@@ Property / cites work: Q3999514 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+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 @@
+Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:439936