On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (Q1603641): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems complete for deterministic logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability by constant-depth polynomial-size circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-depth, polynomial-size circuits for symmetric functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopy in two-dimensional digital images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A topological characterization of thinning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacency in digital pictures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302435 / rank
 
Normal rank

Latest revision as of 10:49, 4 June 2024

scientific article
Language Label Description Also known as
English
On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
scientific article

    Statements

    On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (English)
    0 references
    0 references
    0 references
    15 July 2002
    0 references
    digital topology
    0 references
    computational complexity
    0 references
    reachability
    0 references
    homotopy
    0 references

    Identifiers