Privately releasing conjunctions and the statistical query barrier

Full Text: PDFPDF SIGN IN to get this Article
Authors: Anupam Gupta Carnegie Mellon University, Pittsburg, PA, USA
Moritz Hardt Princeton University, Princeton, NJ, USA
Aaron Roth Microsoft Research --- New England Campus, Cambridge, MA, USA
Jonathan Ullman Harvard University, Cambridge, MA, USA
Privately releasing conjunctions and the statistical query barrier Published by ACM 2011 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 111
· Downloads (cumulative): 212
· Citation Count: 6

Published in:
Cover Image
 
· Proceeding
STOC '11 Proceedings of the 43rd annual ACM symposium on Theory of computing
Pages 803-812
ACM New York, NY, USA ©2011
table of contents ISBN: 978-1-4503-0691-1 doi>10.1145/1993636.1993742

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