Keyword

bit complexity

Description: Bit complexity is a measure of computational cost based on the number of bits required to represent and process input and output values.
OpenAlex ID: keywords/bit-complexity
1982 · A. K. Lenstra, H. W. Lenstra, et al. · Mathematische Annalen · 4,892
1979 · Andrew Chi-Chih Yao · ACM Symposium on Theory of Computing (STOC) · 1,567
2000 · P. Salembier, L. Garrido · IEEE Transactions on Image Processing · 655
2000 · Martin Hirt, Kazue Sako · Lecture notes in computer science · 544
2010 · Damien Stehlé, Ron Steinfeld · Lecture notes in computer science · 364
2021 · David Harvey, Joris van der Hoeven · Annals of Mathematics · 312
2010 · Amos Korman, Shay Kutten, et al. · Distributed Computing · 240
2008 · Bartolini, S., Giorgi, R., et al. · Springer eBooks · 223
1990 · Leslie LAMPORT, Nancy LYNCH · Elsevier eBooks · 185
1998 · M. Giusti, J. Heintz, et al. · Journal of Pure and Applied Algebra · 180
2005 · Erich Kaltofen, Gilles Villard · Computational Complexity · 176
1986 · Kenneth J. Perry, Sam Toueg · IEEE Transactions on Software Engineering · 168
1996 · Arne Storjohann · International Symposium on Symbolic and Algebraic Computation · 162
1996 · V.Y. Pan · Computers & Mathematics with Applications · 144
1995 · Yishay Mansour · SIAM Journal on Computing · 142
1997 · M. Giusti, J. Heintz, et al. · Journal of Pure and Applied Algebra · 134
2010 · Y. Métivier, J. M. Robson, et al. · Distributed Computing · 122
1995 · Kenneth Keeler, Jeffery Westbrook · Discrete Applied Mathematics · 118
2016 · David Harvey, Joris van der Hoeven, et al. · Journal of Complexity · 117
1992 · Piotr Berman, Juan A. Garay, et al. · Springer eBooks · 117
2009 · Phong Q. Nguyen, Damien Stehlé · ACM Transactions on Algorithms · 111
Works count: 887
Citation count: 22,910
Year
Topic
Type