AnO(nlgk⋅2n2) time and O(k⋅2nk) space algorithm for certain np-complete problems: Theoretical computer science 51 (1987) 221–227

✍ Scribed by J. Vyskoč

• Publisher: Elsevier Science
• Year: 1990
• Tongue: English
• Weight: 121 KB
• Volume: 70
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/0304-3975(90)90127-4