New Applications of the Incompressibility Method: Part I
Computational Complexity
2007-05-23 v1 Discrete Mathematics
Abstract
The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit new simple proofs using the incompressibility method.
Keywords
Cite
@article{arxiv.cs/9809061,
title = {New Applications of the Incompressibility Method: Part I},
author = {Tao Jiang and Ming Li and Paul Vitanyi},
journal= {arXiv preprint arXiv:cs/9809061},
year = {2007}
}
Comments
15 pages. To appear in The Computer Journal