Deterministic Complexity
Deterministic Complexity is a theoretical construct in computational complexity theory that characterizes the minimum amount of computational resources required by a deterministic algorithm to solve a decision problem in the worst case.
80
Publications
3.3K
Citations
139
Authors
87
Institutions
Publications per year
2017–2026
12
Parents
80
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Leonid Gurvits · 2003 · 465 citations
Computing, Mathematics, Physics +16
On the Tape Complexity of Deterministic Context-Free Languages
I. Hal Sudborough · Journal of the ACM · 1978 · 227 citations · Full text
Complexity of a determinate algorithm for the discrete logarithm
V. I. Nechaev · Mathematical Notes · 1994 · 225 citations
1–5 of 80
139
6
h-index
6
h-index
4
h-index
3
h-index
3
h-index
1–5 of 139
87
University of Michigan
Ann Arbor, United States
4 h-index
8 publications
452 citations
Hebrew University of Jerusalem
Jerusalem, Israel
3 h-index
3 publications
94 citations
ETH Zurich
Zurich, Switzerland
3 h-index
4 publications
153 citations
Tsinghua University
Beijing, China
3 h-index
3 publications
85 citations

Eötvös Loránd University
Budapest, Hungary
2 h-index
5 publications
92 citations

University of Pisa
Pisa, Italy
2 h-index
2 publications
35 citations

University of North Texas
Denton, United States
2 h-index
4 publications
70 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
2 publications
50 citations
1–8 of 87
4 publications · 102 citations
4
h-index
Repository · 4 publications · 66 citations
4
h-index
2 publications · 120 citations
2
h-index
2 publications · 94 citations
2
h-index
2 publications · 44 citations
2
h-index
1–5