16430 search results - page 306 / 3286 » On Computable Tree Functions |
124
click to vote
STOC
1999
ACM
15 years 9 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...
143
click to vote
FOSSACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We introduce a domain-theoretic computational model for multivariable differential calculus, which for the first time gives rise to data types for differentiable functio...
139
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
134
click to vote
HICSS
2009
IEEE
15 years 11 months ago
2009
IEEE
The craft of software understanding and verification can benefit from technologies that enable evolution toward a true engineering discipline. In current practice, software develo...
127
Voted
IPL
2000
15 years 4 months ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...