An O(n^lg k . 2^n/2) Time and O(k . 2^n/k) Space Algorithm for Certain NP-Complete Problems

Jozef Vyskoc. An O(n^lg k . 2^n/2) Time and O(k . 2^n/k) Space Algorithm for Certain NP-Complete Problems. Theoretical Computer Science, 51:221-227, 1987.

Abstract

Abstract is missing.