13603 search results - page 280 / 2721 » On the Computational Complexity of Cut-Reduction |
143
click to vote
SAGA
2007
Springer
16 years 28 days ago
2007
Springer
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...
170
click to vote
COMPGEOM
1996
ACM
15 years 11 months ago
1996
ACM
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...
