2060 search results - page 1 / 412 » Some Applications of Coding Theory in Computational Complexi... |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
IFIPTCS
2000
13 years 8 months ago
2000
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged betwee...
DAGSTUHL
2006
13 years 6 months ago
2006
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
ENTCS
2011
12 years 11 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...