Green's theorem and isolation in planar graphs (Q714498): Difference between revisions

@@ Property / DOI @@
-.1016/j.ic.2012.03.002
@@ Property / DOI: 10.1016/j.ic.2012.03.002 / 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.ic.2012.03.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2139649317
@@ Property / OpenAlex ID: W2139649317 / 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 @@
+Q5786239
@@ Property / cites work: Q5786239 / rank @@
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / 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 @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+On Threshold Circuits and Polynomial Computation
@@ Property / cites work: On Threshold Circuits and Polynomial Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform constant-depth threshold circuits for division and iterated multiplication.
+Normal rank
@@ Property / DOI @@
+.1016/J.IC.2012.03.002
@@ Property / DOI: 10.1016/J.IC.2012.03.002 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:714498