단행본 상세

서지주요정보
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P"
서명 / 저자 Primality Testing in Polynomial Time [electronic resource] : From Randomized Algorithms to "PRIMES Is in P" / by Martin Dietzfelbinger.
저자명 Dietzfelbinger, Martin. author. aut http://id.loc.gov/vocabulary/relators/aut
단체명 SpringerLink (Online service)
판사항 1st ed. 2004.
발행사항 Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
총서명 Lecture Notes in Computer Science, 1611-3349 ; 3000
Online Access https://doi.org/10.1007/b12334 URL

서지기타정보

서지기타정보
ISBN 9783540259336
기타 표준번호 10.1007/b12334
청구기호 QA241-247.5
형태사항 X, 150 p. online resource.
언어 English
내용 1. Introduction: Efficient Primality Testing -- 2. Algorithms for Numbers and Their Complexity -- 3. Fundamentals from Number Theory -- 4. Basics from Algebra: Groups, Rings, and Fields -- 5. The Miller-Rabin Test -- 6. The Solovay-Strassen Test -- 7. More Algebra: Polynomials and Fields -- 8. Deterministic Primality Testing in Polynomial Time -- A. Appendix.
주제 Number theory.
Algebra.
Algorithms.
Computer science.
Cryptography.
Data encryption (Computer science).
Computer science --Mathematics.
Mathematical statistics.
Number Theory.
Algebra.
Algorithms.
Theory of Computation.
Cryptology.
Probability and Statistics in Computer Science.
보유판 및 특별호 저록 Springer Nature eBook
Printed edition: 9783540403449 Printed edition: 9783662174456
QR CODE