911 search results - page 17 / 183 » Kolmogorov Complexity Cores |
132
click to vote
SIGAL
1990
15 years 6 months ago
1990
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
JSYML
2006
15 years 1 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
143
click to vote
INFORMATICALT
2010
15 years 11 days ago
2010
The genetic information in cells is stored in DNA sequences, represented by a string of four letters, each corresponding to a definite type of nucleotides. Genomic DNA sequences a...
106
click to vote
EUROGP
2001
Springer
15 years 6 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
LREC
2008
15 years 3 months ago
2008
Traditional Authorship Attribution models extract normalized counts of lexical elements such as nouns, common words and punctuation and use these normalized counts or ratios as fe...