The complexity of searching in X+Y and other multisets
From MaRDI portal
DOI10.1016/0020-0190(90)90144-MzbMATH Open0696.68052MaRDI QIDQ911276FDOQ911276
Authors: Michel Cosnard, Jean Duprat, Afonso G. Ferreira 
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized Selection and Ranking: Sorted Matrices
- Computing Partitions with Applications to the Knapsack Problem
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Lower Bounds for Selection in X + Y and Other Multisets
- Sorting X + Y
- 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
- Complexity of selection in \(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
- Title not available (Why is that?)
- 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)
