This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 4 5 51 mod 7 i b i z 5 1 1 5 4 1 25 mod 7 = 4 20 mod 7 = 6 3 36 mod 7 = 1 1 2 1 1 1 1 1 5 1 25 mod 7 = 4 20 mod 7 = 6 05/15/09 CS284162/Spring09/GWU/Vora/Exponentiation 5 Computational Complexity Computational complexity of the following operations on x ( k bit) and y ( l bit), k ≥ l : – x + y – x – y – xy – Floor( x/y ) O( l(kl )) – gcd( x , y ) O( k 3 ) 05/15/09 CS284162/Spring09/GWU/Vora/Exponentiation 6 Computational Complexity mod n Computational complexity of the following operations on mod n, where n is a kbit integer: – x + y – x – y – xy – x1 – x c c< n O(k 2 log c) = O(k 3 )...
View
Full Document
 Spring '09
 Computational complexity theory, Formal language, Computational Complexity

Click to edit the document details