Nonuniform Complexity Classes
Nonuniform Complexity Classes is a complexity-theoretic category comprising computational problems solvable by families of Boolean circuits whose structure may vary arbitrarily with input length, distinguished from uniform classes by the absence of a required computational constraint linking circuit descriptions across different input sizes.
65
Publications
5.6K
Citations
76
Authors
58
Institutions
Publications per year
2017–2026
2
Parents
65
Complexity and real computation
Choice Reviews Online · 1998 · 1.3K citations
Some connections between nonuniform and uniform complexity classes
Richard M. Karp, Richard J. Lipton · 1980 · 582 citations · Full text
Almost everywhere high nonuniform complexity
Jack H. Lutz · Journal of Computer and System Sciences · 1992 · 260 citations
Theory of computational complexity
Choice Reviews Online · 2001 · 229 citations
1–5 of 65
76
5
h-index
Rutgers, The State University of New Jersey, United States
4 publications · 235 citations
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 76
58
Universitat Politècnica de Catalunya
Barcelona, Spain
4 h-index
7 publications
292 citations
Iowa State University
Ames, United States
4 h-index
4 publications
315 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
3 h-index
4 publications
106 citations
Stanford University
Stanford, United States
3 h-index
3 publications
77 citations

University of Massachusetts Amherst
Amherst Center, United States
2 h-index
3 publications
81 citations

Harvard University Press
Cambridge, United States
2 h-index
2 publications
66 citations

Cornell University
Ithaca, United States
2 h-index
2 publications
147 citations

Duquesne University
Pittsburgh, United States
2 h-index
2 publications
66 citations
1–8 of 58
11 publications · 622 citations
11
h-index
5 publications · 193 citations
5
h-index
3 publications · 411 citations
3
h-index
CRO · 2 publications · 1.5K citations
2
h-index
JACM · 2 publications · 153 citations
2
h-index
1–5