A nearly optimal algorithm to decompose binary forms.
Matías R. BenderJean-Charles FaugèreLudovic PerretElias P. TsigaridasPublished in: J. Symb. Comput. (2021)
Keyphrases
- dynamic programming
- k means
- computational complexity
- preprocessing
- computational cost
- worst case
- locally optimal
- objective function
- optimal solution
- experimental evaluation
- probabilistic model
- learning algorithm
- optimal path
- input data
- cost function
- times faster
- non binary
- globally optimal
- improved algorithm
- recognition algorithm
- closed form
- matching algorithm
- detection algorithm
- optimization algorithm
- classification algorithm
- state space
- convergence rate
- theoretical analysis
- space complexity
- piecewise linear
- expectation maximization
- particle swarm optimization
- significant improvement
- neural network