Given a convex polytope $\{x\in \mathbb R^n | Ax\leq b\}$ where $A$ is a matrix, and $b$ is a vector, and inequality between two vectors (like $Ax\leq b$) means inequality between their components ($\forall i : (Ax)_i \leq b_i$).Is it NP-complete to compute its volume? Or are there efficient algorithms for doing that?Thanks in advance!
Complexity of Computing Volume of Convex Polytope
algorithms;time complexity;np complete;computational geometry