Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs (Q5089210): Difference between revisions

@@ label / en / label / en @@
+Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The Polynomially Bounded Perfect Matching Problem Is in NC 2
+Normal rank
@@ Property / cites work @@
+Isolation, matching, and counting uniform and nonuniform upper bounds
+Normal rank
@@ Property / cites work @@
+Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Constant Depth Reducibility
@@ Property / cites work: Constant Depth Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Space complexity of perfect matching in bounded genus bipartite graphs
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite perfect matching is in quasi-NC
@@ Property / cites work: Bipartite perfect matching is in quasi-NC / rank @@
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Compressed Decision Problems in Hyperbolic Groups.
+Normal rank
@@ Property / cites work @@
+Q4608568
@@ Property / cites work: Q4608568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3891767
@@ Property / cites work: Q3891767 / 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 @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Making Nondeterminism Unambiguous
@@ Property / cites work: Making Nondeterminism Unambiguous / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://drops.dagstuhl.de/opus/volltexte/2020/12709/pdf/LIPIcs-MFCS-2020-43.pdf/
+Normal rank
@@ Property / OpenAlex ID @@
+W3082057387
@@ Property / OpenAlex ID: W3082057387 / rank @@
+Normal rank
@@ Property / title @@
+Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs (English)
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5089210