On space-efficient algorithms for certain NP-complete problems
From MaRDI portal
Publication:1314378
DOI10.1016/0304-3975(93)90295-5zbMath0807.68052OpenAlexW1979985963MaRDI QIDQ1314378
Publication date: 1 March 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90295-5
Related Items (1)
Cites Work
- The complexity of searching in \(X+Y\) and other multisets
- 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
- An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems
- Complexity of selection in \(X+Y\)
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Merging and Sorting Applied to the Zero-One Knapsack Problem
This page was built for publication: On space-efficient algorithms for certain NP-complete problems
