An O(nlgK · 2n/2) time and O(k · 2 n/K) space algorithm for certain NP-complete problems

• Authors:

• J. Vyskoč

• Affiliations:

• Institute of Technical Cybernetics, Bratislava, Czechoslovakia

• Venue:
• Theoretical Computer Science
• Year:
• 1987