Approximating the smallest grammar: Kolmogorov complexity in natural models

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Moses Charikar Princeton University
Eric Lehman MIT
Ding Liu Princeton University
Rina Panigrahy Cisco Systems
Manoj Prabhakaran Princeton University
April Rasala MIT
Amit Sahai Princeton University
abhi shelat MIT
Approximating the smallest grammar: Kolmogorov complexity in natural models Published by ACM 2002 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 26
· Downloads (cumulative): 502
· Citation Count: 12

Published in:
Cover Image
 
· Proceeding
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Pages 792 - 801
ACM New York, NY, USA ©2002
table of contents ISBN:1-58113-495-9 doi>10.1145/509907.510021

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder