Sciweavers

COCO
2004
Springer
78views Algorithms» more  COCO 2004»
14 years 4 months ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek