On lower bounds for the complexity of polynomials and their multiples.

Walter Baur Karin Halupczok

Published in: Comput. Complex. (1999)

Keyphrases

lower bound
worst case
upper bound
branch and bound
computational complexity
branch and bound algorithm
space complexity
complexity measures
genetic algorithm
database systems
objective function
np hard
average case complexity
memory requirements
polynomial approximation