An Algorithm for the Quillen-Suslin Theorem for Quotients of Polynomial Rings by Monomial Ideals.
Reinhard C. LaubenbacherKaren SchlauchPublished in: J. Symb. Comput. (2000)
Keyphrases
- computational complexity
- learning algorithm
- detection algorithm
- experimental evaluation
- optimal solution
- significant improvement
- cost function
- dynamic programming
- preprocessing
- computational cost
- times faster
- matching algorithm
- theoretical analysis
- worst case
- np hard
- expectation maximization
- k means
- optimization algorithm
- selection algorithm
- tree structure
- classification algorithm
- partially ordered
- recognition algorithm
- high accuracy
- convergence rate
- improved algorithm
- convex hull
- computationally efficient
- denoising
- lower bound
- objective function
- reinforcement learning