Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity
Jean-Charles FaugèreMohab Safey El DinPierre-Jean SpaenlehauerPublished in: CoRR (2010)
Keyphrases
- computational complexity
- computational cost
- worst case
- space complexity
- times faster
- numerically stable
- reduced complexity
- lower complexity
- significant improvement
- learning algorithm
- computationally efficient
- orders of magnitude
- recently developed
- machine learning
- convergence rate
- partial order
- simulated annealing
- data structure
- computationally complex
- polynomial equations