APA (7th ed.) Citation

Czerwinski, W., & Orlikowski, L. (2022, February). Reachability in Vector Addition Systems is Ackermann-complete. Proceedings / annual Symposium on Foundations of Computer Science, 1229-1240. https://doi.org/10.1109/FOCS52979.2021.00120

Chicago Style (17th ed.) Citation

Czerwinski, Wojciech, and Lukasz Orlikowski. "Reachability in Vector Addition Systems Is Ackermann-complete." Proceedings / Annual Symposium on Foundations of Computer Science Feb. 2022: 1229-1240. https://doi.org/10.1109/FOCS52979.2021.00120.

MLA (9th ed.) Citation

Czerwinski, Wojciech, and Lukasz Orlikowski. "Reachability in Vector Addition Systems Is Ackermann-complete." Proceedings / Annual Symposium on Foundations of Computer Science, Feb. 2022, pp. 1229-1240, https://doi.org/10.1109/FOCS52979.2021.00120.