Sciweavers

Share
APAL
2006
67views more  APAL 2006»
9 years 10 months ago
On partial randomness
If x = x1x2
Cristian S. Calude, Ludwig Staiger, Sebastiaan Ter...
CORR
2008
Springer
115views Education» more  CORR 2008»
9 years 10 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff
CORR
2010
Springer
89views Education» more  CORR 2010»
9 years 10 months ago
An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...
David Doty
SIROCCO
1997
9 years 12 months ago
Better Expanders and Superconcentrators by Kolmogorov Complexity
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...
Uwe Schöning
IJIT
2004
10 years 5 hour ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
DAGSTUHL
2006
10 years 15 hour ago
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence fo
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...
Boris Ryabko, Jaakko Astola, Alexander Gammerman
HCI
2007
10 years 1 days ago
An Epileptic Seizure Prediction Algorithm from Scalp EEG Based on Morphological Filter and Kolmogorov Complexity
Epilepsy is the most common neurological disorder in the world, second only to stroke. There are nearly 15 million patients suffer from refractory epilepsy, with no available ther...
Guanghua Xu, Jing Wang, Qing Zhang, Junming Zhu
CAE
2007
10 years 1 months ago
Conceptualizing Birkhoff's Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
Jaume Rigau, Miquel Feixas, Mateu Sbert
CIE
2006
Springer
10 years 2 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
ASIACRYPT
1999
Springer
10 years 2 months ago
Linear Complexity versus Pseudorandomness: On Beth and Dai's Result
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
Yongge Wang
books