Cover Image

Kolmogorov Complexity and Computational Complexity /

Show other versions (1)

There are many ways to measure the complexity of a given object, but there are two measures of particular importance in the theory of computing: One is Kolmogorov complexity, which measures the amount of information necessary to describe an object. Another is computational complexity, which measures...

Full description

Bibliographic Details
Main Author:	Watanabe, Osamu
Corporate Author:	SpringerLink (Online service)
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 1992.
Series:	EATCS monographs on theoretical computer science.
Subjects:	Computer science. Computer software. Combinatorial analysis. Electronic books.
Online Access:	Connect to the full text of this electronic book

Similar Items

Fundamentals of Computation Theory : International Conference FCT '87 Kazan, USSR, June 22-26, 1987. Proceedings /
by: Budach, L. (Lothar), 1935-
Published: (1987)

Computing and combinatorics : 8th annual international conference, COCOON 2002, Singapore, August 2002 : proceedings /
Published: (2002)

Computing and combinatorics : 7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001 : proceedings /
Published: (2001)

Computing and combinatorics : 9th annual international conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003 : proceedings /
Published: (2003)

Computing and combinatorics : second annual international conference, COCOON '96, Hong Kong, June 17-19, 1996 : proceedings /
Published: (1996)

Combinatorics, Computability and Logic : Proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS'01) /
by: Calude, C. S.
Published: (2001)

Computability and Complexity Theory /
by: Homer, S. (Steven)
Published: (2001)

The Complexity Theory Companion /
by: Hemaspaandra, Lane A.
Published: (2002)

Algorithms in Combinatorial Geometry /
by: Edelsbrunner, Herbert
Published: (1987)

The Graph Isomorphism Problem : Its Structural Complexity /
by: Köbler, Johannes
Published: (1993)

Computing and combinatorics : 6th annual international conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 : proceedings /
Published: (2000)

Information and Randomness : An Algorithmic Perspective /
by: Calude, Cristian S.
Published: (2002)

Computing and combinatorics : 4th annual international conference, COCOON '98, Taipei, Taiwan, R.o.C., August 12-14, 1998 : proceedings /
Published: (1998)

Grid Generation and Adaptive Algorithms /
by: Bern, Marshall W.
Published: (1999)

Fundamentals of Computation Theory : International Conference FCT '89, Szeged, Hungary, August 21-25, 1989. Proceedings /
by: Csirik, J. (János)
Published: (1989)

A Basis for Theoretical Computer Science /
by: Arbib, Michael A.
Published: (1981)

Theory of Semi-Feasible Algorithms /
by: Hemaspaandra, Lane A.
Published: (2003)

Nonsequential Processes : a Petri Net View /
by: Best, Eike
Published: (1988)

STACS 89 : 6th Annual Symposium on Theoretical Aspects of Computer Science Paderborn, FRG, February 16-18, 1989 Proceedings /
Published: (1989)

Mathematical Foundations of Computer Science 1993 : 18th International Symposium, MFCS '93, Gdansk, Poland, August 30 - September 3, 1993. Proceedings /
by: Borzyszkowski, Andrzej M.
Published: (1993)

Introduction to Programming with Mathematica® : Includes diskette /
by: Gaylord, Richard J.
Published: (1993)

Algorithm Theory - SWAT '94 : 4th Scandianvian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994. Proceedings /
by: Schmidt, Erik M.
Published: (1994)

Selected Writings on Computing: A personal Perspective /
by: Dijkstra, Edsger W.
Published: (1982)

Computing and Combinatorics : 5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999 : Proceedings /
Published: (1999)

Algorithms for Parallel Processing /
by: Heath, Michael T.
Published: (1999)

Trees in Algebra and Programming - CAAP '94 : 19th International Colloquium, Edinburgh, U.K., April 11-13, 1994. Proceedings /
by: Tison, Sophie
Published: (1994)

Introduction to Circuit Complexity : A Uniform Approach /
by: Vollmer, Heribert
Published: (1999)

Algorithms and Order /
by: Rival, Ivan
Published: (1988)

The Design of an Extendible Graph Editor /
by: Paulisch, Frances N.
Published: (1993)

Evolutionary Algorithms : The Role of Mutation and Recombination /
by: Spears, William M.
Published: (2000)

STACS 88 : 5th Annual Symposium on Theoretical Aspects of Computer Science Bordeaux, France, February 11-13, 1988 Proceedings /
Published: (1988)

Lectures on the Complexity of Bilinear Problems /
by: Groote, Hans F. de
Published: (1987)

Random Generation of Trees : Random Generators in Computer Science /
by: Alonso, Laurent
Published: (1995)

Computability /
by: Weihrauch, Klaus
Published: (1987)

Handbook of Formal Languages : Volume 3 Beyond Words /
by: Rozenberg, Grzegorz
Published: (1997)

One-Factorizations /
by: Wallis, W. D.
Published: (1997)

Handbook of Formal Languages : Volume 2. Linear Modeling: Background and Application /
by: Rozenberg, Grzegorz
Published: (1997)

ISA '91 Algorithms : 2nd International Symposium on Algorithms, Taipei, Republic of China, December 16-18, 1991. Proceedings /
by: Hsu, Wen-Lian
Published: (1991)

An Introduction to Kolmogorov Complexity and Its Applications /
by: Li, Ming
Published: (1993)

Mathematical Foundations of Software Development. Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, March 25-29, 1985 : Volume 1: Colloquium on Trees in Algebra and /
by: Ehrig, Hartmut
Published: (1985)