Poly-logarithmic independence fools bounded-depth boolean circuits
Mark Braverman · Communications of the ACM · 2011
research-article Share on Poly-logarithmic independence fools bounded-depth boolean circuits Author: Mark Braverman University of Toronto University of TorontoView Profile Authors Info & Claims Communications of the ACMVolume 54Issue 4April 2011 pp 108–115https://doi.org/10.1145/1924421.1924446Published:01 April 2011Publication History 17citation4,689DownloadsMetricsTotal Citations17Total Downloads4,689Last 12 Months3,836Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access