An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems
From MaRDI portal
Publication:1101220
DOI10.1016/0304-3975(87)90056-9zbMath0642.68072OpenAlexW2115661336MaRDI QIDQ1101220
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90056-9
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Discrete mathematics in relation to computer science (68R99)
Related Items (2)
Corrigendum: An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot s^{n/k})\) space algorithm for certain NP-complete problems ⋮ On space-efficient algorithms for certain NP-complete problems
Cites Work
This page was built for publication: An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems
