Rotor-routing reachability is easy, chip-firing reachability is hard (Q2066002)

From MaRDI portal
Revision as of 05:45, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Rotor-routing reachability is easy, chip-firing reachability is hard
scientific article

    Statements

    title
    Rotor-routing reachability is easy, chip-firing reachability is hard (English)
    0 references
    publication date
    13 January 2022
    0 references
    zbMATH Keywords
    rotor-routing reachability problem
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C57
    0 references
    05C20
    0 references
    91A43
    0 references
    68R10
    0 references
    68Q17
    0 references
    zbMATH DE Number
    7456673
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2066002&oldid=26694536"
    Powered by MediaWiki