What is the complexity of volume calculation?

DOI10.1006/jcom.2001.0610zbMath1051.68083OpenAlexW2076273693MaRDI QIDQ700188

Henryk Woźniakowski, Arthur G. Werschulz

Publication date: 30 September 2002

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.2001.0610

zbMATH Keywords

surface integration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Piecewise linear approximation of smooth compact fibers
• Variational properties of averaged equations for periodic media
• Deterministic and stochastic error bounds in numerical analysis
• The problem of calculating the volume of a polyhedron is enumerably hard
• Computing Volumes of Polyhedra
• Random walks and anO*(n5) volume algorithm for convex bodies
• Direct methods in the calculus of variations
• What is the complexity of surface integration?

This page was built for publication: What is the complexity of volume calculation?