Login / Signup
Upper Bounds on the Complexity of some Galois Theory Problems
Vikraman Arvind
Piyush P. Kurur
Published in:
Electron. Colloquium Comput. Complex. (2003)
Keyphrases
</>
upper bound
decision problems
lower bound
theoretical framework
problems involving
evolutionary algorithm
worst case
combinatorial optimization
neural network
knowledge base
computational complexity
np hard
np complete
np hardness