Keyword

certificate complexity

Description: Certificate complexity is a measure of Boolean function complexity based on the number of input bits needed to certify an output, studied in theoretical computer science.
OpenAlex ID: keywords/certificate-complexity
2002 · Harry Buhrman, Ronald de Wolf · Theoretical Computer Science · 834
2016 · Scott Aaronson, Shalev Ben-David, et al. · ACM Symposium on Theory of Computing (STOC) · 132
2005 · Shengyu Zhang · Theoretical Computer Science · 105
2013 · Avishay Tal · Conference on Innovations in Theoretical Computer Science · 97
2017 · Andris Ambainis, Kaspars Balodis, et al. · Journal of the ACM · 77
2008 · Sophie Laplante, Frédéric Magniez · SIAM Journal on Computing · 68
2014 · Hung Q. Ngo, Dung T. Nguyen, et al. · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · 66
2004 · Scott Aaronson · Journal of Computer and System Sciences · 61
2011 · Pooya Hatami, Raghav Kulkarni, et al. · Theory of Computing · 56
2004 · Shengyu Zhang · Lecture notes in computer science · 55
2013 · Troy Lee, Frédéric Magniez, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 52
2004 · S. Laplante, F. Magniez · IEEE Conference on Computational Complexity (CCC) · 51
1984 · György Turán · Information Processing Letters · 50
2016 · Justin Gilmer, Michael Saks, et al. · COMBINATORICA · 47
2014 · Aleksandrs Belovs, Ansis Rosmanis · Computational Complexity · 36
1997 · Lane A. Hemaspaandra, Jörg Rothe, et al. · Acta Informatica · 33
2014 · Andris Ambainis, Mohammad Bavarian, et al. · Lecture notes in computer science · 32
2016 · Ben-David, Shalev, Hatami, Pooya, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 30
2017 · Mark Bun, Justin Thaler · Annual Symposium on Foundations of Computer Science · 29
2016 · Feuilloley, Laurent, Fraigniaud, Pierre, et al. · Aaltodoc (Aalto University) · 27
2019 · Scott Aaronson, Daniel Grier, et al. · Annual Symposium on Foundations of Computer Science · 26
2023 · Peter Dixon, A. Pavan, et al. · neural information processing systems · 25
2019 · Mark Bun, Justin Thaler · SIAM Journal on Computing · 24
2013 · Aleksandrs Belovs, Ansis Rosmanis · IEEE Conference on Computational Complexity (CCC) · 23
2003 · Scott Aaronson · SIAM Journal on Computing · 23
Works count: 153
Citation count: 2,483
Year
Topic
Type