15_P_KriptoLog_Sudet_Teor Page 1

15_P_KriptoLog_Sudet_Teor Page 2

15_P_KriptoLog_Sudet_Teor Page 3

15_P_KriptoLog_Sudet_Teor Page 4

15_P_KriptoLog_Sudet_Teor Page 5

Computational complexity theory - Wikipedia, the free encyclopediahttp://en.wikipedia.org/wiki/Computational_complexity_theory

15_P_KriptoLog_Sudet_Teor Page 6

PRIMES is in PManindra Agrawal, Neeraj Kayal, Nitin Saxena.�Department of Computer Science & Engineering Indian Institute of Technology Kanpur.Kanpur-208016, INDIA.Email: {manindra,kayaln,nitinsa}@iitk.ac.inAbstractWe present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite. Cituojamas: 643 šaltiniuose.

Ann. of Math. (2), 160:2 (2004) 781--793. Available from http://www.cse.iitk.ac.in/users/manindra/. MR2123939

15_P_KriptoLog_Sudet_Teor Page 7

15_P_KriptoLog_Sudet_Teor Page 8

Screen clipping taken: 2010.11.11; 11:02

15_P_KriptoLog_Sudet_Teor Page 9

15_P_KriptoLog_Sudet_Teor Page 10

15_P_KriptoLog_Sudet_Teor Page 11

15_P_KriptoLog_Sudet_Teor Page 12

15_P_KriptoLog_Sudet_Teor Page 13

15_P_KriptoLog_Sudet_Teor Page 14

15_P_KriptoLog_Sudet_Teor Page 15

Reduction (complexity) - Wikipedia, the free encyclopediahttp://en.wikipedia.org/wiki/Reduction_(complexity)

15_P_KriptoLog_Sudet_Teor Page 16