Math 480, Spring 2015, Assignment 12
From cartan.math.umb.edu
Carefully define the following terms:
- $L(X)$.
Carefully state the following theorems (you do not need to prove them):
- Expected time complexity for the relation-building stage of Dickson's method.
Carefully describe the following algorithms:
- Quadratic sieve.
Solve the following problems:
- Problem 3.33.