Pages that link to "Item:Q2364904"
From MaRDI portal
The following pages link to Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904):
Displaying 4 items.
- Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)
- ALMOST EUCLIDEAN SECTIONS OF THE N-DIMENSIONAL CROSS-POLYTOPE USING O(N) RANDOM BITS (Q3526528) (← links)
- REDUCING THE TIME COMPLEXITY AND IDENTIFYING ILL-POSED PROBLEM INSTANCES OF MINKOWSKI SUM BASED SIMILARITY CALCULATIONS (Q3647617) (← links)
- A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum (Q6045460) (← links)