2200 search results - page 40 / 440 » Bloch's Constant is Computable |
GIS
2010
ACM
14 years 8 months ago
2010
ACM
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
STOC
1999
ACM
15 years 2 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
COLT
2000
Springer
15 years 2 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
IWFM
2003
14 years 11 months ago
2003
We outline a possible logic that will allow us to give a unified approach to reasoning about computational effects. The logic is given by extending Moggi’s computational λ-cal...