Complexity bounds for the rational Newton-Puiseux algorithm over finite fields.

Adrien Poteaux Marc Rybowicz

Published in: Appl. Algebra Eng. Commun. Comput. (2011)

Keyphrases

complexity bounds
worst case
computational complexity
np hard
objective function
optimal solution
database
data mining
database systems
linear programming
matching algorithm
heuristic search
autonomous agents
constraint satisfaction