Wulf, L. (2025). Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings). 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS), Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on, FOCS, 531. https://doi.org/10.1109/FOCS63196.2025.00029
Παραπομπή σε μορφή Chicago (17η εκδ.)Wulf, Lasse. "Computing the Polytope Diameter Is Even Harder than NP-hard (Already for Perfect Matchings)." 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS), Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on, FOCS 2025: 531. https://doi.org/10.1109/FOCS63196.2025.00029.
Παραπομπή σε μορφή MLA (9th εκδ.)Wulf, Lasse. "Computing the Polytope Diameter Is Even Harder than NP-hard (Already for Perfect Matchings)." 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. 531, https://doi.org/10.1109/FOCS63196.2025.00029.