Computer Science – Computational Complexity
Scientific paper
1998-09-23
Computer Science
Computational Complexity
13 pages. Submitted to TCS
Scientific paper
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.
Buhrman Harry
Jiang Tao
Li Ming
Vitanyi Paul
No associations
LandOfFree
New Applications of the Incompressibility Method: Part II does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with New Applications of the Incompressibility Method: Part II, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Applications of the Incompressibility Method: Part II will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-194284