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

DOI10.1016/0304-3975(90)90127-4zbMath0701.68034OpenAlexW2236773193MaRDI QIDQ914372

Jozef Vyskoč

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90127-4

zbMATH Keywords

NP-complete problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (1)

On space-efficient algorithms for certain NP-complete problems

Cites Work

• An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems

This page was built for publication: 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