X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Buch
    Buch
    Primality testing in polynomial time : from randomized algorithms to "Primes is in p" (2004)
    Berlin [u.a.] :Springer,
    Details
    UID:
    almahu_BV019375775
    Umfang: X, 147 S.
    ISBN: 3-540-40344-2
    Serie: Lecture notes in computer science 3000 : tutorial
    Sprache: Deutsch
    Fachgebiete: Informatik , Mathematik
    RVK:
    SS 4800
    RVK:
    SK 180
    Schlagwort(e): Primzahltest ; Polynomialzeitalgorithmus ; Effizienter Algorithmus
    Mehr zum Autor: Dietzfelbinger, Martin, 1956-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Buch
    HU Berlin get availability status
    FU Berlin get availability status
  • 2
    Online-Ressource
    Online-Ressource
    Primality testing in polynomial time : from randomized algorithms to "PRIMES is in P" (2004)
    Berlin : Springer
    Details
    UID:
    gbv_749123435
    Umfang: Online-Ressource (X, 147p. Also available online) , digital
    Ausgabe: Springer eBook collection. Computer science
    ISBN: 9783540259336 , 3540403442 , 9783540403449
    Serie: Lecture notes in computer science 3000
    Inhalt: This book is devoted to algorithms for the venerable primality problem: Given a natural number n, decide whether it is prime or composite. The problem is basic in number theory, efficient algorithms that solve it, i.e., algorithms that run in a number of computational steps which is polynomial in the number of digits needed to write n, are important for theoretical computer science and for applications in algorithmics and cryptology. This book gives a self-contained account of theoretically and practically important efficient algorithms for the primality problem, covering 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 textbook is written for students of computer science, in particular for 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
    Anmerkung: Literaturverz. S. [143] - 144
    Weitere Ausg.: ISBN 9783540403449
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe Dietzfelbinger, Martin, 1956 - Primality testing in polynomial time Berlin : Springer, 2004 ISBN 3540403442
    Sprache: Englisch
    Fachgebiete: Informatik , Mathematik
    RVK:
    SK 180
    RVK:
    SS 4800
    Schlagwort(e): Primzahltest ; Polynomialzeitalgorithmus ; Effizienter Algorithmus ; Primzahltest ; Deterministischer Prozess ; Algorithmus
    DOI: 10.1007/b12334
    URL: lizenzpflichtig
    URL: Volltext  (lizenzpflichtig)
    URL: Inhaltsverzeichnis
    URL: Inhaltstext
    Mehr zum Autor: Dietzfelbinger, Martin 1956-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Online Zugang
    Open Access Wunsch
    UB Potsdam
  • 3
    Buch
    Buch
    Primality testing in polynomial time : from randomized algorithms to "PRIMES is in P" (2004)
    Berlin : Springer
    Details
    UID:
    gbv_36805151X
    Umfang: X, 147 S. , graph. Darst. , 24 cm
    ISBN: 3540403442
    Serie: Lecture notes in computer science 3000
    Inhalt: This book treats algorithms for the venerable "primality problem": Given a natural number n, decide whether it is prime or composite. The problem is basic in number theory; efficient algorithms that solve it, i.e., algorithms that run in a number of computational steps which is polynomial in the number of decimal digits needed to write n, are important for theoretical computer science and for applications in algorithmics and cryptology. This book gives a self-contained account of theoretically and practically important efficient algorithms for the primality problem, covering 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
    Anmerkung: Literaturverz. S. [143] - 144
    Weitere Ausg.: Online-Ausg. Dietzfelbinger, Martin, 1956 - Primality testing in polynomial time Berlin : Springer, 2004 ISBN 9783540259336
    Weitere Ausg.: ISBN 3540403442
    Weitere Ausg.: ISBN 9783540403449
    Weitere Ausg.: Erscheint auch als Online-Ausgabe Dietzfelbinger, Martin Primality Testing in Polynomial Time Berlin, Heidelberg : Springer Berlin Heidelberg, 2004 ISBN 9783540403449
    Sprache: Englisch
    Fachgebiete: Informatik , Mathematik
    RVK:
    SK 180
    RVK:
    SS 4800
    Schlagwort(e): Primzahltest ; Polynomialzeitalgorithmus ; Effizienter Algorithmus
    URL: Autorenbiografie
    URL: Verlagsangaben
    URL: Einführung/Vorwort
    URL: Inhaltsverzeichnis
    URL: Cover
    URL: Inhaltstext
    URL: Volltext  (Restricted to SpringerLINK subscribers)
    Mehr zum Autor: Dietzfelbinger, Martin 1956-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Buch
    Online Zugang
    UB Potsdam get availability status
  • 4
    Buch
    Buch
    Primality testing in polynomial time : from randomized algorithms to "Primes is in p" (2004)
    Berlin [u.a.] : Springer
    Details
    UID:
    b3kat_BV019375775
    Umfang: X, 147 S.
    ISBN: 3540403442
    Serie: Lecture notes in computer science 3000 : tutorial
    Sprache: Deutsch
    Fachgebiete: Informatik , Mathematik
    RVK:
    SK 180
    RVK:
    SS 4800
    Schlagwort(e): Primzahltest ; Polynomialzeitalgorithmus ; Effizienter Algorithmus
    Mehr zum Autor: Dietzfelbinger, Martin 1956-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Buch
    HTW Berlin get availability status
  • 5
    Buch
    Buch
    Primality testing in polynomial time : from randomized algorithms to "Primes is in P" (2004)
    Berlin [u.a.] : Springer-Verlag
    Details
    UID:
    kobvindex_ZLB13767179
    Umfang: X, 147 Seiten , graph. Darst. , 24 cm
    Ausgabe: 1
    ISBN: 3540403442
    Serie: Lecture notes in computer science 3000
    Anmerkung: Text engl.
    Sprache: Englisch
    Schlagwort(e): Polynomialzeitalgorithmus ; Effizienter Algorithmus
    Mehr zum Autor: Dietzfelbinger, Martin
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Buch
    Berlin VÖBB/ZLB get availability status
  • 6
    Online-Ressource
    Online-Ressource
    Primality Testing in Polynomial Time : From Randomized Algorithms to "PRIMES Is in P" (2004)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920695902882
    Umfang: X, 150 p. , online resource.
    ISBN: 9783540259336
    Serie: Lecture Notes in Computer Science, 3000
    Inhalt: 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 problem”hasa“deterministic 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.
    Anmerkung: 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.
    In: Springer eBooks
    Weitere Ausg.: Printed edition: ISBN 9783540403449
    Sprache: Englisch
    DOI: 10.1007/b12334
    URL: http://dx.doi.org/10.1007/b12334
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    HU Berlin
  • 7
    Online-Ressource
    Online-Ressource
    Primality Testing in Polynomial Time : From Randomized Algorithms to "PRIMES Is in P" (2004)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621102102882
    Umfang: X, 150 p. , online resource.
    Ausgabe: 1st ed. 2004.
    ISBN: 9783540259336
    Serie: Lecture Notes in Computer Science, 3000
    Inhalt: 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 problem"hasa"deterministic 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.
    Anmerkung: 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.
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783540403449
    Weitere Ausg.: Printed edition: ISBN 9783662174456
    Sprache: Englisch
    DOI: 10.1007/b12334
    URL: https://doi.org/10.1007/b12334
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    HU Berlin
Nichts oder nicht das Richtige gefunden? Bitte überprüfen Sie Ihre Suchanfrage oder benutzen Sie den Fernleihindex.
Meinten Sie 3540003142?
Meinten Sie 3540401482?
Meinten Sie 3540102442?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz