Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Reference5 articles.
1. Factoring Polynomials Over Finite Fields
2. Minimum partition of a matroid into independent subsets
3. Reducibility among Combinatorial Problems
4. Tests for primality by the converse of Fermat’s theorem
5. Donald E. Knuth, The art of computer programming. Vol. 2, Addison-Wesley Publishing Co., Reading, Mass., 1981, 270–275, A. Schonhage and V. Strassen (1971), past multiplication of large numbers, Computing, 7, pp. 281–292, (In German.)MR6338780895.65001
Cited by
215 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. SAT and Lattice Reduction for Integer Factorization;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16
2. Certifying Giant Nonprimes;Lecture Notes in Computer Science;2023
3. An Homage to the Beautiful Mathematical EWDs;Edsger Wybe Dijkstra;2022-07-12
4. A Bi-Directional Extensible Interface Between Lean and Mathematica;Journal of Automated Reasoning;2022-01-30
5. Comparison of the complexity of Diffie–Hellman and discrete logarithm problems;Journal of Computer Virology and Hacking Techniques;2020-04-13