logo
Wrong email address or username
Wrong email address or username
Incorrect verification code

Primality Testing In Polynomial Time: From Randomized Algorithms To "Primes Is In P" (Lecture Notes In Computer Science) - editions back

by Martin Dietzfelbinger
Add a new edition
language per page
Primality Testing In Polynomial Time: From Randomized Algorithms To "Primes Is In P" (Lecture Notes In Computer Science) - Martin Dietzfelbinger
Primality Testing In Polynomial Time: From Randomized Algorithms To "Primes Is In P" (Lecture Notes In Computer Science)
by Martin Dietzfelbinger (author)
publisher: Springer publish date: June 29th 2004
format: paperback pages: 147
language: English
ISBN: 3540403442 (9783540403449)
Primality Testing in Polynomial Time: From Randomized Algorithms to "Primes Is in P" - Martin Dietzfelbinger
Primality Testing in Polynomial Time: From Randomized Algorithms to "Primes Is in P"
by Martin Dietzfelbinger (author)
publisher: Springer publish date: January 1st 2004
format: ebook pages: 161
language: English
ISBN: 1280307951 (9781280307959)
Copyright © 2025 BookLikes Press About Terms of Services Privacy Policy Contact Us Blog FAQ Patronaty medialne BookLikes for Authors Partners panel Team Themes Docs API Blogs
Need help?
Important: Our sites use cookies. We use the information stored using cookies and similar technologies for advertising and statistics purposes. Stored data allow us to tailor the websites to individual user's interests. Cookies may be also used by third parties cooperating with BookLikes, like advertisers, research companies and providers of multimedia applications. You can choose how cookies are handled by your device via your browser settings. If you choose not to receive cookies at any time, BookLikes will not function properly and certain services will not be provided. For more information, please go to our Privacy Policy.