Computational Complexity Of Languages
Computational Complexity of Languages is a theoretical framework within formal language theory that classifies languages based on the asymptotic resource requirements, such as time and space, of the most efficient Turing machine deciding membership in the language.
896
Publications
45.4K
Citations
1.2K
Authors
487
Institutions
Publications per year
2017–2026
70
Parents
896
Extensions of recurrent neural network language model
Tomáš Mikolov, Stefan Kombrink, Lukáš Burget et al. · 2011 · 1.6K citations
Fiftieth volume of theoretical computer science
Maurice Nivat · Theoretical Computer Science · 1988 · 1.3K citations
Word problems requiring exponential time(Preliminary Report)
Larry J. Stockmeyer, Albert R. Meyer · 1973 · 874 citations
The mathematical theory of context-free languages
H. P. Edmundson · Information Storage and Retrieval · 1967 · 738 citations
1–5 of 896
1.2K
14
h-index
13
h-index
11
h-index
10
h-index
10
h-index
1–5 of 1.2K
487

University of Waterloo
Waterloo, Canada
17 h-index
46 publications
1.4K citations
Queen's University
Kingston, Canada
14 h-index
22 publications
704 citations

Centre National de la Recherche Scientifique
Paris, France
14 h-index
24 publications
936 citations

University of Turku
Turku, Finland
13 h-index
21 publications
799 citations

Cornell University
Ithaca, United States
13 h-index
20 publications
1.6K citations
Mathematical Institute of the Slovak Academy of Sciences
Bratislava, Slovakia
12 h-index
12 publications
529 citations
Slovak Academy of Sciences
Bratislava, Slovakia
12 h-index
12 publications
513 citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
13 publications
1.8K citations
1–8 of 487
77 publications · 3.8K citations
28
h-index
54 publications · 5.1K citations
28
h-index
IJFCS · 30 publications · 1.1K citations
18
h-index
22 publications · 879 citations
17
h-index
27 publications · 1.6K citations
17
h-index
1–5