Skip Navigation

The Computer Journal 1999 42(4):287-293; doi:10.1093/comjnl/42.4.287
© 1999 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Jiang, T.
Right arrow Articles by Vitányi, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

New Applications of the Incompressibility Method

Tao JiangA1, Ming LiA2 and Paul VitányiA3

A1 Department of Computer Science, McMaster University, Hamilton, Ontario L8S 4K1, Canada A2 Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada A3 CWI and University of Amsterdam, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands Email: paulv@cwi.nl

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.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.