New Applications of the Incompressibility Method: Part II
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.
Cite
@article{arxiv.cs/9809060,
title = {New Applications of the Incompressibility Method: Part II},
author = {Harry Buhrman and Tao Jiang and Ming Li and Paul Vitanyi},
journal= {arXiv preprint arXiv:cs/9809060},
year = {2007}
}
Comments
13 pages. Submitted to TCS