Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P": 3000 - Brossura

Libro 21 di 58: Lecture Notes in Computer Science

Dietzfelbinger, Martin

 
9783540403449: Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P": 3000
Brossura
ISBN 10: 3540403442 ISBN 13: 9783540403449
Casa editrice: Springer, 2008

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull?autore

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Springer
Data di pubblicazione
2008
Lingua
Inglese
ISBN 10 
3540403442
ISBN 13 
9783540403449
Rilegatura
Copertina flessibile
Numero di pagine
160
Contatto del produttore
ProductSafety@springernature.com
ProductSafety@springernature.com

Poststr. 9
Darmstadt
64293
Germania

Altre edizioni note dello stesso titolo

9783662174456: Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P"

Edizione in evidenza

ISBN 10:  3662174456 ISBN 13:  9783662174456
Casa editrice: Springer, 2014
Brossura