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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2012.03.002 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2012.03.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139649317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making Nondeterminism Unambiguous / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean complexity classes vs. their arithmetic analogs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation, matching, and counting uniform and nonuniform upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Planar Reachability Is in Unambiguous Log-Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministically isolating a perfect matching in bipartite planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar and grid graph reachability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Threshold Circuits and Polynomial Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform constant-depth threshold circuits for division and iterated multiplication. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2012.03.002 / rank
 
Normal rank

Latest revision as of 01:37, 10 December 2024

scientific article
Language Label Description Also known as
English
Green's theorem and isolation in planar graphs
scientific article

    Statements

    Identifiers