Author:
Barenghi Alessandro,Biasse Jean-François,Persichetti Edoardo,Santini Paolo
Publisher
Springer International Publishing
Reference19 articles.
1. 2007. https://csrc.nist.gov/Projects/Post-Quantum-Cryptography
2. Lecture Notes in Computer Science;N Alamati,2020
3. Lecture Notes in Computer Science;N Aragon,2019
4. Babai, L.: Graph isomorphism in quasipolynomial time. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 684–697 (2016)
5. Bardet, M., Otmani, A., Saeed-Taha, M.: Permutation code equivalence is not harder than graph isomorphism when hulls are trivial. In: IEEE ISIT 2019, pp. 2464–2468 (2019)
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献