Login / Signup
Corrigendum: An O(n^lgk . 2^n/2) Time and O(k . 2^n/2) Space Algorithm for Certain NP-Complete Problems.
Jozef Vyskoc
Published in:
Theor. Comput. Sci. (1990)
Keyphrases
</>
learning algorithm
dynamic programming
search space
np hard
cost function
search strategy
randomly generated
special case
benchmark problems
objective function
search algorithm
computational complexity
np complete
combinatorial optimization
boolean functions
space complexity