Exponential Space
Exponential Space is a complexity class in computational theory that comprises decision problems solvable by a deterministic Turing machine using an amount of memory that grows exponentially with respect to the input size.
130
Publications
6.7K
Citations
300
Authors
151
Institutions
Publications per year
2017–2026
30
Parents
130
Word problems requiring exponential time(Preliminary Report)
Larry J. Stockmeyer, Albert R. Meyer · 1973 · 874 citations
Efficient and extensible algorithms for multi query optimization
Prasan Roy, S. Seshadri, S. Sudarshan et al. · ACM SIGMOD Record · 2000 · 409 citations
Efficient and extensible algorithms for multi query optimization
Prasan Roy, S. Seshadri, S. Sudarshan et al. · 2000 · 226 citations
1–5 of 130
300
3
h-index
IBM Research - Thomas J. Watson Research Center, United States
3 publications · 1.6K citations
3
h-index
National Research University Higher School of Economics, Russia
3 publications · 150 citations
3
h-index
3
h-index
3
h-index
1–5 of 300
151
Purdue University West Lafayette
West Lafayette, United States
4 h-index
9 publications
405 citations

TU Wien
Vienna, Austria
4 h-index
8 publications
134 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
9 publications
386 citations
Steklov Mathematical Institute
Moscow, Russia
3 h-index
3 publications
150 citations

Uppsala University
Uppsala, Sweden
3 h-index
6 publications
237 citations

National Research University Higher School of Economics
Moscow, Russia
3 h-index
3 publications
150 citations
RWTH Aachen University
Aachen, Germany
3 h-index
6 publications
317 citations
University of Oxford
Oxford, United Kingdom
3 h-index
3 publications
56 citations
1–8 of 151
Repository · 8 publications · 359 citations
8
h-index
4 publications · 255 citations
4
h-index
2 publications · 39 citations
2
h-index
2 publications · 45 citations
2
h-index
2 publications · 72 citations
2
h-index
1–5