Applications of Ramsey's theorem to decision tree complexity

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Shlomo Moran Technion, Haifa, Israel
Marc Snir Hebrew Univ., Jerusalem, Israel
Udi Manber Univ. of Wisconsin-Madison, Madison
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 32 Issue 4, Oct. 1985
Pages 938-949
ACM New York, NY, USA
table of contents doi>10.1145/4221.4259
Applications of Ramsey's theorem to decision tree complexity Published by ACM 1985 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 12
· Downloads (cumulative): 615
· Citation Count: 7


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