Keyword

Boolean function complexity

Description: A measure or study of the resources, such as circuit size or computation time, required to represent or compute Boolean functions.
OpenAlex ID: keywords/boolean-function-complexity
1982 · Kurt Mehlhorn, Erik M. Schmidt · ACM Symposium on Theory of Computing (STOC) · 296
1975 · David E. Muller, Franco P. Preparata · Journal of the ACM · 174
1983 · Norbert Blum · Theoretical Computer Science · 116
1983 · Vuillemin · IEEE Transactions on Computers · 108
1995 · David Rubinstein · COMBINATORICA · 90
1975 · P. Erdös, R.L. Graham, et al. · Computers & Mathematics with Applications · 90
1990 · K.-T. Cheng, V.D. Agrawal · ACM/IEEE Design Automation Conference (DAC) · 80
2004 · Claire Kenyon, Samuel Kutin · Information and Computation · 65
1976 · Nicholas Pippenger · Theory of Computing Systems · 59
2016 · F. Ablayev, A. Gainutdinova, et al. · Lobachevskii Journal of Mathematics · 52
1994 · Kai-Yeung Siu, V.P. Roychowdhury, et al. · IEEE Transactions on Information Theory · 52
1984 · György Turán · Information Processing Letters · 50
2017 · Kamil Khadiev, Aliya Khadieva · Lecture notes in computer science · 39
2005 · Danièle Gardy · Discrete Mathematics & Theoretical Computer Science · 38
1997 · A D Korshunov · Journal of the Operational Research Society · 34
1992 · Cambridge University Press eBooks · 32
1975 · H. Brakhage · Lecture notes in computer science · 32
1995 · Janoš Šimon, Anna Gál · 31
1989 · Stasys P. Jukna · Lecture notes in computer science · 30
2006 · Miguel Couceiro, Stephan Foldes, et al. · Discrete Mathematics · 28
2014 · Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii · Information and Computation · 27
2019 · Golovnev, Alexander, Ilango, Rahul, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 25
Works count: 209
Citation count: 3,027
Year
Topic
Type