Andrei A. Muchnik, Nikolai K. Vereshchagin  Home/Search
Context
Related
| lpcs.math.msu.ru/~ver/pap...shenhypo.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lpcs.math.msu.ru/~ver/publenc (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate Kolmogorov complexity of the problem (a ! c) (b ! d), defined as the minimum length of a program that given a outputs c and given b outputs d. We prove that unlike all known problems of this kind its complexity is not expressible in terms of Kolmogorov complexity of a, b, c, and d, their pairs, triples etc. This solves the problem posed in [9]. (Update)
Active bibliography (related documents): More All
0.5: Some Recent Progress in Algorithmic Randomness - Downey (Correct)
0.5: Identification under Random Processes - Ahlswede, Balakirsky (1996) (Correct)
0.0: Timing Analysis of Combinational Circuits in Intuitionistic.. - Mendler (1999) (Correct)
Similar documents based on text: More All
1.2: Logical operations and Kolmogorov complexity - Shen, Vereshchagin (Correct)
1.0: Upper Semi-Lattice of Binary Strings With the.. - Muchnik.. (1997) (Correct)
0.8: Upper Semi-Lattice of Binary Strings With the.. - Chernov, Muchnik, .. (Correct)
BibTeX entry: (Update)
@inproceedings{ muchnik01logical,
author = "Muchnik",
title = "Logical Operations and Kolmogorov Complexity {II}",
booktitle = "{SCT}: Annual Conference on Structure in Complexity Theory",
year = "2001",
url = "citeseer.ist.psu.edu/484709.html" }
Citations (may not include all citations):660 An Introduction to Kolmogorov Complexity and its Application.. - Li, Vit'anyi - 1997
343 Introduction to metamathematics (context) - Kleene - 1952
245 A measure of asymptotic efficiency for tests of a hypothesis.. (context) - Chernoff - 1952
48 IEEE transactions on Information Theory (context) - Bennett, G'acs et al.
12 Zur Deutung der Intuitionistischen Logik (context) - Kolmogoroff - 1932
2 On common information and related characteristics of correla.. - Ahlswede, Korner - 1974
2 x is simple conditional to y (context) - Muchnik, Romashchenko et al. - 1999
1 To be published in Theoretical Computer Science (context) - Muchnik, complexity
1 To be published in Theoretical Computer Science (context) - Shen, Vereshchagin et al.
Documents on the same site (http://lpcs.math.msu.ru/~ver/publ-enc.html): More
Randomized Boolean Decision Trees: Several Remarks - Vereshchagin (1998) (Correct)
Independent Minimum Length Programs to Translate Between.. - Vereshchagin, Vyugin (Correct)
A General Method to Construct Oracles Realizing Given.. - Muchnik, Vereshchagin (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC