Bennett, H., Bhatia, D., Biasse, J., Durisheti, M., LaBuff, L., Pallozzi Lavorante, V., & Waitkevich, P. (2026). Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem. IEEE Transactions on Information Theory, Information Theory, IEEE Transactions on, IEEE Trans. Inform. Theory, 72(2), 1093-1108. https://doi.org/10.1109/TIT.2025.3637683
Παραπομπή σε μορφή Chicago (17η εκδ.)Bennett, H., D. Bhatia, J. Biasse, M. Durisheti, L. LaBuff, V. Pallozzi Lavorante, και P. Waitkevich. "Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem." IEEE Transactions on Information Theory, Information Theory, IEEE Transactions on, IEEE Trans. Inform. Theory 72, no. 2 (2026): 1093-1108. https://doi.org/10.1109/TIT.2025.3637683.
Παραπομπή σε μορφή MLA (9th εκδ.)Bennett, H., et al. "Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem." IEEE Transactions on Information Theory, Information Theory, IEEE Transactions on, IEEE Trans. Inform. Theory, vol. 72, no. 2, 2026, pp. 1093-1108, https://doi.org/10.1109/TIT.2025.3637683.