Upper Bounds on the Complexity of Some Galois Theory Problems.

Vikraman Arvind Piyush P. Kurur

Published in: ISAAC (2003)

Keyphrases

upper bound
worst case
lower bound
np complete
polynomial hierarchy
optimization problems
decision problems
evolutionary algorithm
theoretical framework
efficiently computable
neural network
np hardness
lower and upper bounds
combinatorial optimization
computational cost
np hard
search algorithm