2588 search results - page 10 / 518 » Applications of Kolmogorov complexity to computable model th... |
CRYPTO
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
124
click to vote
FOGA
2011
14 years 2 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
CEC
2008
IEEE
15 years 5 months ago
2008
IEEE
— Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a cost effe...