scientific article
From MaRDI portal
Publication:3602887
zbMath1221.68095MaRDI QIDQ3602887
Publication date: 12 February 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Elementary problems in Euclidean geometries (51M04) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (11)
Covering convex bodies and the closest vector problem ⋮ Staffing large-scale service systems with distributional uncertainty ⋮ Penalty-based aggregation of multidimensional data ⋮ Non-asymptotic bounds for the \(\ell_{\infty}\) estimator in linear regression with uniform noise ⋮ Relaxing the strong triadic closure problem for edge strength inference ⋮ Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations ⋮ How to integrate a polynomial over a simplex ⋮ Multidimensional Binary Search for Contextual Decision-Making ⋮ Fast Multidimensional Asymptotic and Approximate Consensus ⋮ Complexity of approximating the vertex centroid of a polyhedron ⋮ Resilient multi-dimensional consensus in adversarial environment
This page was built for publication:
