Pages that link to "Item:Q1785063"
From MaRDI portal
The following pages link to Complexity and approximation of finding the longest vector sum (Q1785063):
Displaying 8 items.
- Complexity and approximation of the longest vector sum problem (Q1644921) (← links)
- On the co-NP-completeness of the zonotope containment problem (Q2068561) (← links)
- Adaptive reachability algorithms for nonlinear systems using abstraction error analysis (Q2085160) (← links)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- Approximability of the Problem of Finding a Vector Subset with the Longest Sum (Q4973237) (← links)
- On the Complexity of Approximate Sum of Sorted List (Q5405940) (← links)
- Complexity and algorithms for finding a subset of vectors with the longest sum (Q5918111) (← links)
- (Q6115392) (← links)