عنوان

Primality testing in polynomial time :

شابک

1280307951

شابک

3540259333

شابک

9781280307959

شابک

9783540259336

شابک اشتباه

3540403442

شابک اشتباه

9783540403449

شماره

b140294

عنوان اصلي

Primality testing in polynomial time :

نام عام مواد

[Book]

ساير اطلاعات عنواني

from randomized algorithms to "primes" is in P /

نام نخستين پديدآور

Martin Dietzfelbinger.

وضعيت ويراست

1st ed.

محل نشرو پخش و غیره

New York :

نام ناشر، پخش کننده و غيره

Springer,

تاریخ نشرو بخش و غیره

©2004.

نام خاص و کميت اثر

1 online resource (x, 147 pages)

عنوان فروست

Tutorial.

مشخصه جلد

3000.

شاپا ي ISSN فروست

0302-9743 ;

متن يادداشت

Includes bibliographical references (pages 143-144) and index.

متن يادداشت

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.

بدون عنوان

0

متن يادداشت

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.

عنوان

Primality testing in polynomial time.

شماره استاندارد بين المللي کتاب و موسيقي

3540403442

موضوع مستند نشده

Algorithms.

موضوع مستند نشده

Numbers, Prime.

موضوع مستند نشده

Polynomials.

موضوع مستند نشده

Algorithms.

موضوع مستند نشده

Numbers, Prime.

موضوع مستند نشده

Polynomials.

شماره رده

نشانه اثر

مستند نام اشخاص تاييد نشده

Dietzfelbinger, Martin.

تاريخ عمليات

20170421042201.2

قواعد فهرست نويسي ( بخش توصيفي )

pn

نام الکترونيکي

نوع ماده

[Book]

تكميل شده

Y