Complexity of selection in \(X+Y\)
From MaRDI portal
Publication:1124333
DOI10.1016/0304-3975(89)90027-3zbMath0678.68034MaRDI QIDQ1124333
Publication date: 1989
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(89)90027-3
Related Items
On space-efficient algorithms for certain NP-complete problems, Optimal algorithms for generalized searching in sorted matrices