Polynomial-Size Circuits is a family of Boolean circuits in which the size of each circuit, measured by the number of gates, is bounded by a polynomial function of the input length, distinguishing it from super-polynomial or exponential-size circuit families in circuit complexity theory.
204
Publications
15.5K
Citations
272
Authors
146
Institutions
Publications per year
2017–2026
18
Parents
Publications
204
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
Sanjam Garg, Craig Gentry, Shai Halevi et al. · 2013 · 1.1K citations
Fault-tolerant quantum computation
Peter W. Shor · 2002 · 915 citations
Computing, Computer Science, Physics +17
Andrew Chi-Chih Yao · 2002 · 661 citations
1–5 of 204
Authors
272
- AW
7
h-index
- CG
7
h-index
- JB
6
h-index
- VVVinod Vaikuntanathan
Massachusetts Institute of Technology, United States
6 publications · 4K citations
6
h-index
- AS
6
h-index
1–5 of 272
Institutions
146
Hebrew University of Jerusalem
Jerusalem, Israel
9 h-index
12 publications
688 citations
IBM (United States)
Armonk, United States
9 h-index
17 publications
7.1K citations
University of Washington
Seattle, United States
9 h-index
13 publications
719 citations
Stanford University
Stanford, United States
8 h-index
9 publications
2.2K citations
Princeton University
Princeton, United States
8 h-index
9 publications
974 citations
Weizmann Institute of Science
Rehovot, Israel
7 h-index
11 publications
1.7K citations
Institute for Advanced Study
Princeton, United States
7 h-index
12 publications
317 citations
University of Toronto
Toronto, Canada
7 h-index
10 publications
4.1K citations
1–8 of 146
Venues
- SIAM Journal on Computing
24 publications · 1.5K citations
18
h-index
- IACR Cryptology ePrint Archive
Repository · 10 publications · 530 citations
10
h-index
- Theoretical Computer Science
5 publications · 229 citations
5
h-index
- Journal of the ACM
JACM · 5 publications · 377 citations
5
h-index
- SIAM Journal on Discrete Mathematics
5 publications · 439 citations
5
h-index
1–5