APA (7th ed.) Citation

Lysikov, V., & Walter, M. (2025). Complexity theory of orbit closure intersection for tensors: Reductions, completeness, and graph isomorphism hardness. 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS), Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on, FOCS, 486. https://doi.org/10.1109/FOCS63196.2025.00027

Chicago Style (17th ed.) Citation

Lysikov, Vladimir, and Michael Walter. "Complexity Theory of Orbit Closure Intersection for Tensors: Reductions, Completeness, and Graph Isomorphism Hardness." 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS), Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on, FOCS 2025: 486. https://doi.org/10.1109/FOCS63196.2025.00027.

MLA (9th ed.) Citation

Lysikov, Vladimir, and Michael Walter. "Complexity Theory of Orbit Closure Intersection for Tensors: Reductions, Completeness, and Graph Isomorphism Hardness." 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS), Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on, FOCS, 2025, p. 486, https://doi.org/10.1109/FOCS63196.2025.00027.