<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2011-11-18 11:45:34Cook–Levin theorem Factorization of polynomials over a finite field and irreducibility tests Mathematics Modular arithmetic Computational complexity theory |
|
| First Page | Document Content | |
|---|---|---|
Date: 2011-11-18 11:45:34Cook–Levin theorem Factorization of polynomials over a finite field and irreducibility tests Mathematics Modular arithmetic Computational complexity theory |
|
Data reduction for weighted and outlier-resistant clustering