Subscribe to:
Post Comments (Atom)

skip to main |
skip to sidebar
## Thursday, March 5, 2009

###
Factoring

## Labels

Sam asked me about the complexity of factoring, and the fastest known algorithms for it. Here is a very nice survey by Pomerance about the best known algorithms. Some light reading for you over Spring Break!

Subscribe to:
Post Comments (Atom)

- Lecture Summary (28)
- Announcement (21)
- Beyond the Lectures (15)
- Lecture Details (3)
- Encoding (1)
- Kolmogorov (1)
- Learning Theory (1)
- NP (1)
- complexity classes (1)
- derandomization (1)
- descriptive complexity theory (1)

## No comments:

## Post a Comment

Note: Only a member of this blog may post a comment.