scientific article; zbMATH DE number 1003231

From MaRDI portal

Revision as of 21:38, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4335190

Jump to:navigation, search

zbMath0873.68095MaRDI QIDQ4335190

Pankaj K. Agarwal, Subhash Suri

Publication date: 23 April 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (7)

Convergence analysis of variational and non-variational multigrid algorithms for the Laplace-Beltrami operator ⋮ On the complexity of approximating and illuminating three-dimensional convex polyhedra ⋮ On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees ⋮ The class cover problem with boxes ⋮ Characterizing regions of attraction for piecewise affine systems by continuity of discrete transition functions ⋮ Lower bounds for the number of hyperplanes separating two finite sets of points ⋮ Variable resolution triangulations

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4335190&oldid=18299930"