An O(M(n) log n) algorithm for the Jacobi symbol
Richard P. BrentPaul ZimmermannPublished in: CoRR (2010)
Keyphrases
- preprocessing
- computational cost
- optimization algorithm
- computational complexity
- significant improvement
- improved algorithm
- worst case
- np hard
- experimental evaluation
- optimal solution
- selection algorithm
- matching algorithm
- detection algorithm
- objective function
- space complexity
- segmentation algorithm
- expectation maximization
- cost function
- tree structure
- times faster
- memory requirements
- high accuracy
- learning algorithm