New Applications of the Incompressibility Method: Part I

Simple item page
dc.creatorJiang, Tao
dc.creatorLi, Ming
dc.creatorVitanyi, Paul
dc.date1998-09-23
dc.date.accessioned2026-07-07T03:23:35Z
dc.date.available2026-07-07T03:23:35Z
dc.descriptionThe 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.
dc.description15 pages. To appear in The Computer Journal
dc.identifierhttps://arxiv.org/abs/cs/9809061
dc.identifierhttp://arxiv.org/abs/cs/9809061
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33003
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectF.1.3; G.2.1
dc.titleNew Applications of the Incompressibility Method: Part I
dc.typetext

Files

Collections

arXiv