# Computing the Volume is Difficult.

Discrete & computational geometry (1987)

- Volume: 2, page 319-326
- ISSN: 0179-5376; 1432-0444/e

## Access Full Article

top## How to cite

topBárány, I., and Füredi, Zoltán. "Computing the Volume is Difficult.." Discrete & computational geometry 2 (1987): 319-326. <http://eudml.org/doc/131025>.

@article{Bárány1987,

author = {Bárány, I., Füredi, Zoltán},

journal = {Discrete & computational geometry},

keywords = {volume computation; time complexity; width of convex sets},

pages = {319-326},

title = {Computing the Volume is Difficult.},

url = {http://eudml.org/doc/131025},

volume = {2},

year = {1987},

}

TY - JOUR

AU - Bárány, I.

AU - Füredi, Zoltán

TI - Computing the Volume is Difficult.

JO - Discrete & computational geometry

PY - 1987

VL - 2

SP - 319

EP - 326

KW - volume computation; time complexity; width of convex sets

UR - http://eudml.org/doc/131025

ER -

## Citations in EuDML Documents

top- S. V. Konyagin, On the number of irreducible polynomials with 0,1 coefficients
- Martin Kochol, Constructive approximation of a ball by polytopes
- A. Dubickas, S. V. Konyagin, On the number of polynomials of bounded measure
- Yehoram Gordon, Marius Junge, Volume ratios in ${L}_{p}$-spaces
- Marcel Berger, Konvexita (2. část)

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.