2588 search results - page 7 / 518 » Applications of Kolmogorov complexity to computable model th... |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
SODA
2003
ACM
15 years 16 days ago
2003
ACM
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
87
Voted
CORR
2000
Springer
14 years 11 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
APAL
2010
14 years 11 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
VISUALIZATION
2002
IEEE
15 years 4 months ago
2002
IEEE
We report on using computed tomography (CT) as a model acquisition tool for complex objects in computer graphics. Unlike other modeling and scanning techniques the complexity of t...