Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P": 3000 (Lecture Notes in Computer Science) - Tapa blanda
Sinopsis
A self-contained treatment of theoretically and practically important efficient algorithms for the primality problem. The text covers the randomized algorithms by Solovay-Strassen and Miller-Rabin from the late 1970s as well as the recent deterministic algorithm of Agrawal, Kayal and Saxena. The volume is written for students of computer science, in particular those with a special interest in cryptology, and students of mathematics, and it may be used as a supplement for courses or for self-study.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
Univ.-Prof. Dr.(USA) Martin Dietzfelbinger (b. 1956) studied Mathematics in Munich and earned his Ph.D. from the University of Illinois at Chicago. In 1992, he obtained his Habilitation at the Universität Paderborn with a thesis on randomized algorithms; in the same year he became a professor of computer science at the Universität Dortmund. Since 1998, he holds the chair for Complexity Theory and Efficient Algorithms at the Faculty of Computer Science and Automation of the Technische Universität Ilmenau, Germany. His main research interests are in complexity theory and data structures.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Primality Testing in Polynomial Time: From Randomized...
Imagen de archivo
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)
Librería: Recycle Bookstore, San Jose, CA, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: Very Good. Book has faint rubbing to covers, light wear to edges, a small smudge to bottom textblock. otherwise in great condition, strong binding, bright and unmarked pages; an overall sturdy copy with clean interiors. Nº de ref. del artículo: 1024313
Comprar usado
EUR 24,89
Gastos de envío:
EUR 4,97
A Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Primality Testing in Polynomial Time: From Randomized Algorithms to "Primes is in P"
Librería: Moe's Books, Berkeley, CA, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
softcover. Condición: very good. no jacket. Nearly new. Nº de ref. del artículo: 1137600
Comprar usado
EUR 26,71
Gastos de envío:
EUR 5,62
A Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
paperback. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Nº de ref. del artículo: S_393661091
Comprar usado
EUR 35,02
Gastos de envío:
EUR 3,24
A Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Primality Testing in Polynomial Time : From Randomized Algorithms to "Primes Is in P"
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 2064038-n
Comprar nuevo
EUR 53,60
Gastos de envío:
EUR 2,28
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Primality Testing in Polynomial Time (Paperback)
Publicado por
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2004
ISBN 10: 3540403442
ISBN 13: 9783540403449
Nuevo
Paperback
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: new. Paperback. On August 6, 2002,a paper with the title PRIMES is in P, by M. Agrawal, N. Kayal, and N. Saxena, appeared on the website of the Indian Institute of Technology at Kanpur, India. In this paper it was shown that the primality problemhasadeterministic algorithm that runs in polynomial time. Finding out whether a given number n is a prime or not is a problem that was formulated in ancient times, and has caught the interest of mathema- ciansagainandagainfor centuries. Onlyinthe 20thcentury,with theadvent of cryptographic systems that actually used large prime numbers, did it turn out to be of practical importance to be able to distinguish prime numbers and composite numbers of signi?cant size. Readily, algorithms were provided that solved the problem very e?ciently and satisfactorily for all practical purposes, and provably enjoyed a time bound polynomial in the number of digits needed to write down the input number n. The only drawback of these algorithms is that they use randomization that means the computer that carries out the algorithm performs random experiments, and there is a slight chance that the outcome might be wrong, or that the running time might not be polynomial. To ?nd an algorithmthat gets by without rand- ness, solves the problem error-free, and has polynomial running time had been an eminent open problem in complexity theory for decades when the paper by Agrawal, Kayal, and Saxena hit the web. To ?nd an algorithmthat gets by without rand- ness, solves the problem error-free, and has polynomial running time had been an eminent open problem in complexity theory for decades when the paper by Agrawal, Kayal, and Saxena hit the web. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9783540403449
Comprar nuevo
EUR 55,96
Gastos de envío:
GRATIS
A Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020166152
Comprar nuevo
EUR 52,67
Gastos de envío:
EUR 3,45
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Primality Testing in Polynomial Time : From Randomized Algorithms to "Primes Is in P"
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 2064038
Comprar usado
EUR 61,34
Gastos de envío:
EUR 2,28
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540403449_new
Comprar nuevo
EUR 57,54
Gastos de envío:
EUR 13,62
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science)
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540403449
Comprar nuevo
EUR 55,60
Gastos de envío:
EUR 17,61
De Reino Unido a Estados Unidos de America
Cantidad disponible: 10 disponibles
Imagen del vendedor
Primality Testing in Polynomial Time : From Randomized Algorithms to "Primes Is in P"
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 2064038-n
Comprar nuevo
EUR 57,53
Gastos de envío:
EUR 17,06
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles