| | |
| | |
Stat |
Members: 3645 Articles: 2'504'585 Articles rated: 2609
25 April 2024 |
|
| | | |
|
Article overview
| |
|
New Applications of the Incompressibility Method: Part II | Harry Buhrman
; Tao Jiang
; Ming Li
; Paul Vitanyi
; | Date: |
23 Sep 1998 | Subject: | Computational Complexity; Discrete Mathematics ACM-class: F.1.3; G.2.1 | cs.CC cs.DM | Affiliation: | CWI), Tao Jiang (McMaster U.), Ming Li (U of Waterloo), Paul Vitanyi (CWI and U of Amsterdam | 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. | Source: | arXiv, cs.CC/9809060 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |