APA (7th ed.) Citation

Velasquez, A., Subramani, K., & Wojciechowski, P. (2022). On the complexity of and solutions to the minimum stopping and trapping set problems. Theoretical computer science, 915, 26-44. https://doi.org/10.1016/j.tcs.2022.02.028

Chicago Style (17th ed.) Citation

Velasquez, Alvaro, K. Subramani, and Piotr Wojciechowski. "On the Complexity of and Solutions to the Minimum Stopping and Trapping Set Problems." Theoretical Computer Science 915 (2022): 26-44. https://doi.org/10.1016/j.tcs.2022.02.028.

MLA (9th ed.) Citation

Velasquez, Alvaro, et al. "On the Complexity of and Solutions to the Minimum Stopping and Trapping Set Problems." Theoretical Computer Science, vol. 915, 2022, pp. 26-44, https://doi.org/10.1016/j.tcs.2022.02.028.