zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Li, Ming; Vitányi, Paul M. B.
An introduction to Kolmogorov complexity and its applications. 3rd ed. (English) Zbl 1185.68369
Texts in Computer Science. New York, NY: Springer (ISBN 978-0-387-33998-6/hbk; 978-0-387-49820-1/ebook). xxiii, 790 p. EUR 60.94 (2008).
See the reviews of the first and second editions (1993; Zbl 0805.68063 ) and (1997; Zbl 0866.68051). New key features and topics in the 3rd edition: New results on randomness; Kolmogorov’s structure function, model selection, and MDL; Incompressibility method: counting unlabeled graphs, Shellsort, communication complexity; Derandomization; Kolmogorov complexity versus Shannon information, rate-distortion, lossy compression, denoising; Theoretical results on information distance; The similarity metric with applications to genomics, phylogeny, clustering, classification, semantic meaning, question-answer systems; Quantum Kolmogorov complexity.

Cited in 1 Review
Cited in 36 Documents
MSC:
68Q30Algorithmic information theory
68-02Research monographs (computer science)
60A05Axioms of probability theory
03B48Probability logic; inductive logic
82B03Foundations of equilibrium statistical mechanics
94A14Modulation and demodulation
WorldCat.org
BibTeX
Full Text: DOI