An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity.
Sergey P. TarasovMikhail N. VyalyiPublished in: CSR (2007)
Keyphrases
- improved algorithm
- dynamic programming
- recognition algorithm
- detection algorithm
- computationally efficient
- worst case
- preprocessing
- cost function
- matching algorithm
- computational cost
- times faster
- computational complexity
- learning algorithm
- single pass
- optimization algorithm
- segmentation algorithm
- theoretical analysis
- expectation maximization
- high accuracy
- probabilistic model
- experimental evaluation
- search space
- objective function
- input data
- tree structure
- np hard
- k means
- memory requirements
- selection algorithm
- neural network