Keyword

sparse sets

Description: Sets of strings whose number of members up to a given length is bounded by a polynomial, studied in computational complexity theory.
OpenAlex ID: keywords/sparse-sets
2021 · Michael L. Bynum, Gabriel A. Hackebeil, et al. · Springer optimization and its applications · 1,144
1981 · Charles H. Bennett, John Gill · SIAM Journal on Computing · 454
1982 · Stephen R. Mahaney · Journal of Computer and System Sciences · 323
1983 · Chee K. Yap · Theoretical Computer Science · 280
2003 · Y. Minsky, A. Trachtenberg, et al. · IEEE Transactions on Information Theory · 229
1982 · R. Kannan · Information and Control · 185
1986 · Lecture notes in computer science · 165
1991 · Mitsunori Ogiwara, Osamu Watanabe · SIAM Journal on Computing · 156
1985 · J. Hartmanis, N. Immerman, et al. · Information and Control · 132
1988 · Jim Kadin · SIAM Journal on Computing · 130
1988 · Eric W. Allender, Roy S. Rubinstein · SIAM Journal on Computing · 127
1989 · Jin-Yi Cai, Thomas Gundermann, et al. · SIAM Journal on Computing · 114
1993 · Preston Briggs, Linda Torczon · ACM Letters on Programming Languages and Systems · 109
1989 · Jim Kadin · Journal of Computer and System Sciences · 106
1979 · Steven Fortune · SIAM Journal on Computing · 98
1985 · Ker-I Ko, Uwe Schöning · SIAM Journal on Computing · 96
1986 · Jose L. Balcázar, Ronald V. Book, et al. · Journal of the ACM · 90
2005 · Luis Antunes, Lance Fortnow, et al. · Theoretical Computer Science · 84
1986 · Eric W. Allender · Lecture notes in computer science · 84
1986 · Hans Heller · Information and Control · 83
1983 · Juris Hartmanis · Information Processing Letters · 80
1975 · Nancy Lynch · Journal of the ACM · 76
1986 · José L. Balcázar, Ronald V. Book, et al. · SIAM Journal on Computing · 75
1992 · Johannes Kobler, Uwe Schïng, et al. · Journal of Computer and System Sciences · 69
Works count: 409
Citation count: 7,424
Year
Topic
Type