|
Algebraic Algorithms

Library Home ||
Full Table of Contents ||
Suggest a Link ||
Library Help

| http://www.cs.umass.edu/~landau/alg_alg.html | |
|
|
|
| Susan Landau; Univ. of Massachusetts at Amherst | |
| The study of optimal algorithms for algebraic problems. Questions range from number theoretic issues (how hard is integer factorization?) to problems about polynomials and complex algebraic structures. Applications of this work include cryptography, symbolic computation, and robotics. Landau has studied problems in and published on polynomial factorization; Galois theory; polynomial decomposition; radical simplification; and number theoretic problems. | |
|
|
|
| Levels: | College, Research |
| Languages: | English |
| Resource Types: | Articles |
| Math Topics: | Polynomials, Linear Algebra, Modern Algebra, Number Theory, Cryptography |
[Privacy Policy] [Terms of Use]


© 1994-2008 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel School of Education.