922 search results - page 49 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
193
click to vote
ECCC
2006
15 years 6 months ago
2006
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
181
click to vote
EC
2006
15 years 6 months ago
2006
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
168
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
156
click to vote
APAL
2005
15 years 6 months ago
2005
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
161
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...