Pages that link to "Item:Q2836761"
From MaRDI portal
The following pages link to On the complexity of certain problems of choosing subset of vectors (Q2836761):
Displaying 9 items.
- On the complexity of some Euclidean optimal summing problems (Q334416) (← links)
- On the complexity and approximability of some Euclidean optimal summing problems (Q506239) (← links)
- Complexity of optimal vector code generation (Q807020) (← links)
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598) (← links)
- Accurate pseudopolynomial-time algorithms for certain NP-hard problems of searching for a vector subsequence (Q2838802) (← links)
- (Q3115696) (← links)
- (Q3115710) (← links)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- Complexity and algorithms for finding a subset of vectors with the longest sum (Q5918111) (← links)