Author image not provided
 Rocco A Servedio

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article3.50
Citation Count7
Publication count2
Publication years2015-2017
Available for download1
Average downloads per article75.00
Downloads (cumulative)75
Downloads (12 Months)75
Downloads (6 Weeks)15
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


2 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 2 of 2
Sort by:

1 published by ACM
August 2017 Journal of the ACM (JACM): Volume 64 Issue 5, October 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 15,   Downloads (12 Months): 75,   Downloads (Overall): 75

Full text available: PDFPDF
We prove an average-case depth hierarchy theorem for Boolean circuits over the standard basis of AND, OR, and NOT gates. Our hierarchy theorem says that for every d ≥ 2, there is an explicit n -variable Boolean function f , computed by a linear-size depth- d formula, which is such ...
Keywords: random projections, random oracles, polynomial hierarchy, Boolean circuit complexity

2
October 2015 FOCS '15: Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

We prove an average-case depth hierarchy theorem for Boolean circuits over the standard basis of AND, OR, and NOT gates. Our hierarchy theorem says that for every d ≥ 2, there is an explicit n-variable Boolean function f, computed by a linear-size depth-d formula, which is such that any depth-(d ...



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