The complexity of searching in X+Y and other multisets
From MaRDI portal
(Redirected from Publication:911276)
Recommendations
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Complexity of selection in \(X+Y\)
- Computing Partitions with Applications to the Knapsack Problem
- Generalized Selection and Ranking: Sorted Matrices
- Lower Bounds for Selection in X + Y and Other Multisets
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
- Selection in \(X+Y\) and matrices with sorted rows and columns
- Sorting X + Y
Cited in
(6)- Optimal algorithms for generalized searching in sorted matrices
- Sorting algorithms for the implementation of a generalized vector product
- On space-efficient algorithms for certain NP-complete problems
- scientific article; zbMATH DE number 18528 (Why is no real title available?)
- Algorithmic complexity of protein identification: Combinatorics of weighted strings
- Complexity of selection in \(X+Y\)
This page was built for publication: The complexity of searching in \(X+Y\) and other multisets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911276)
