ScholarLens Back to search
1993•International Conference for Young Computer ScientistsRequires access

On the relation between linear complexity and Kolmogorov complexity

Feng Bao

Open publisher page 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Relation (database), Computer science, Kolmogorov complexity, Theoretical computer science, Mathematics, Algorithm, Data mining

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On the relation between linear complexity and Kolmogorov complexity — Research Paper | ScholarLens