@inproceedings{10.1145/3373718.3394741,
    Address = {New York, NY, USA},
    Author = {Blondin, Michael and Raskin, Mikhail},
    BookTitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science},
    File = {The Complexity of Reachability in Affine Vector Addition Systems with States - 1909.02579 - a - v.pdf},
    ISBN = {9781450371049},
    Keywords = {reachability, affine transformation, vector addition system, computational complexity},
    Location = {Saarbr\"{u}cken, Germany},
    Pages = {224--236},
    Publisher = {Association for Computing Machinery},
    Series = {LICS '20},
    Title = {The Complexity of Reachability in Affine Vector Addition Systems with States},
    URL = {https://doi.org/10.1145/3373718.3394741},
    Year = {2020},
    bdsk-url-1 = {https://doi.org/10.1145/3373718.3394741},
    date-added = {2020-07-04 09:38:19 +0200},
    date-modified = {2020-07-04 09:38:19 +0200},
    numpages = {13},
    doi = {10.1145/3373718.3394741}
}

@inproceedings{10.1145/3373718.3394741, Address = {New York, NY, USA}, Author = {Blondin, Michael and Raskin, Mikhail}, BookTitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science}, File = {The Complexity of Reachability in Affine Vector Addition Systems with States - 1909.02579 - a - v.pdf}, ISBN = {9781450371049}, Keywords = {reachability, affine transformation, vector addition system, computational complexity}, Location = {Saarbr\"{u}cken, Germany}, Pages = {224--236}, Publisher = {Association for Computing Machinery}, Series = {LICS '20}, Title = {The Complexity of Reachability in Affine Vector Addition Systems with States}, URL = {https://doi.org/10.1145/3373718.3394741}, Year = {2020}, bdsk-url-1 = {https://doi.org/10.1145/3373718.3394741}, date-added = {2020-07-04 09:38:19 +0200}, date-modified = {2020-07-04 09:38:19 +0200}, numpages = {13}, doi = {10.1145/3373718.3394741} }