Back to Results
First PageMeta Content
Computational complexity theory / Theory of computation / Complexity classes / Polynomial-time approximation scheme / BPP / Time complexity / NP / NC


Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann1 and Tobias Friedrich2,3 1
Add to Reading List

Document Date: 2016-01-03 06:44:42


Open Document

File Size: 163,02 KB

Share Result on Facebook