Polynomial Space is the complexity class consisting of all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of memory space relative to the input size.
289
Publications
17.1K
Citations
458
Authors
255
Institutions
Publications per year
2017–2026
32
Parents
Publications
289
Hp spaces of several variables
Charles Fefferman, E. M. Stein · Acta Mathematica · 1972 · 2.9K citations · Full text
Planar Formulae and Their Uses
David Lichtenstein · SIAM Journal on Computing · 1982 · 754 citations
Adi Shamir · Journal of the ACM · 1992 · 657 citations · Full text
1–5 of 289
Authors
458
- AB
9
h-index
- PK
7
h-index
- TH
6
h-index
- MK
5
h-index
- RE
5
h-index
1–5 of 458
Institutions
255
University of Toronto
Toronto, Canada
10 h-index
13 publications
438 citations
Lund University
Lund, Sweden
10 h-index
16 publications
663 citations
University of Warsaw
Warsaw, Poland
7 h-index
9 publications
300 citations
Helsinki Institute for Information Technology
Espoo, Finland
6 h-index
9 publications
518 citations
Weizmann Institute of Science
Rehovot, Israel
6 h-index
12 publications
1K citations
IT University of Copenhagen
Copenhagen, Denmark
6 h-index
6 publications
279 citations
University of Helsinki
Helsinki, Finland
6 h-index
9 publications
417 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
8 publications
757 citations
1–8 of 255
Venues
- SIAM Journal on Computing
15 publications · 1.8K citations
13
h-index
- Journal of Mathematical Analysis and Applications
7 publications · 241 citations
7
h-index
- ACM Transactions on Algorithms
TALG · 5 publications · 157 citations
5
h-index
- arXiv (Cornell University)
Repository · 5 publications · 94 citations
5
h-index
- Pacific Journal of Mathematics
5 publications · 265 citations
5
h-index
1–5