<--- Back to Details
First PageDocument Content
Algebra / Recurrence relation / Computability theory / Elliptic curves / Classical cipher / Extended Euclidean algorithm / Mathematics / Theoretical computer science / Theory of computation
Date: 2010-05-06 17:26:30
Algebra
Recurrence relation
Computability theory
Elliptic curves
Classical cipher
Extended Euclidean algorithm
Mathematics
Theoretical computer science
Theory of computation

Add to Reading List

Source URL: courses.csail.mit.edu

Download Document from Source Website

File Size: 639,08 KB

Share Document on Facebook

Similar Documents

Algebra / Mathematics / Linear algebra / Matrix theory / Multiplication / Numerical linear algebra / Matrices / Invertible matrix / Determinant / Matrix / Extended Euclidean algorithm / Gaussian elimination

Inversion Modulo Zero-dimensional Regular Chains ´ Marc Moreno Maza, Eric Schost, and Paul Vrbik Department of Computer Science, Western University

DocID: 1qREE - View Document

Polynomials / Computer algebra / Resultant / Extended Euclidean algorithm / Factorization of polynomials over finite fields / Polynomial greatest common divisor

On the Complexity of Solving Bivariate Systems: the Case of Non-singular Solutions Romain Lebreton Esmaeil Mehrabi

DocID: 1oHlA - View Document

Computer algebra / Polynomials / Algebraic geometry / Euclid / Extended Euclidean algorithm / Commutative algebra / Euclidean algorithm / Matrix / Polynomial greatest common divisor / Factorization of polynomials over finite fields

On the complexity of the D5 principle Xavier Dahan Marc Moreno Maza ´

DocID: 1oEgL - View Document

Computational number theory / Modular arithmetic / Multiplication / Euclidean algorithm / Greatest common divisor / Multiplicative inverse / Coprime / Modulo operation / Extended Euclidean algorithm / Mathematics / Integer factorization algorithms / Number theory

CS 70 Fall 2003 Discrete Mathematics for CS Wagner

DocID: 1aX14 - View Document