APA (7th ed.) Citation

Karakostas, G., Lipton, R. J., & Viglas, A. (2003). On the complexity of intersecting finite state automata and <f>NL</f> versus <f>NP</f>. Theoretical Computer Science, 302(1-3), 257. https://doi.org/10.1016/S0304-3975(02)00830-7

Chicago Style (17th ed.) Citation

Karakostas, George, Richard J. Lipton, and Anastasios Viglas. "On the Complexity of Intersecting Finite State Automata and NL Versus NP." Theoretical Computer Science 302, no. 1-3 (2003): 257. https://doi.org/10.1016/S0304-3975(02)00830-7.

MLA (9th ed.) Citation

Karakostas, George, et al. "On the Complexity of Intersecting Finite State Automata and NL Versus NP." Theoretical Computer Science, vol. 302, no. 1-3, 2003, p. 257, https://doi.org/10.1016/S0304-3975(02)00830-7.