AnO(nlgk⋅2n2) time and O(k⋅2nk) space algorithm for certain np-complete problems: Theoretical computer science 51 (1987) 221–227
J. VyskočVolume:
70
Year:
1990
Language:
english
Pages:
2
DOI:
10.1016/0304-3975(90)90127-4
File:
PDF, 121 KB
english, 1990