An Algorithm of Subexponential Type Computing the Class Group of Quadratic Orders over Principal Ideal Domains.
Sachar PaulusPublished in: ANTS (1996)
Keyphrases
- computational complexity
- learning algorithm
- objective function
- detection algorithm
- improved algorithm
- high accuracy
- optimization algorithm
- times faster
- computational cost
- experimental evaluation
- linear programming
- matching algorithm
- preprocessing
- simulated annealing
- dynamic programming
- recognition algorithm
- computationally efficient
- np hard
- optimal solution
- tree structure
- semidefinite programming
- segmentation algorithm
- theoretical analysis
- expectation maximization
- particle swarm optimization
- pairwise