229 search results - page 13 / 46 » Proving Bounds on Real-Valued Functions with Computations |
SIAMCOMP
2010
14 years 8 months ago
2010
We propose a general model of local property reconstruction. Suppose we have a function f on domain Γ, which is supposed to have a particular property P, but may not have the pro...
FOCI
2007
IEEE
15 years 4 months ago
2007
IEEE
Immune Algorithms have been used widely and successfully in many computational intelligence areas including optimization. Given the large number of variants of each operator of thi...
FSE
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
FCT
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
ENTCS
2007
14 years 10 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...