Complexity Analysis
Complexity Analysis is a methodological framework within logic programming that characterizes the computational resources required by a program or algorithm, distinguished by its formal evaluation of time, space, or other complexity measures with respect to input size and logical inference steps.
1.9K
Publications
96.7K
Citations
4.8K
Authors
1.6K
Institutions
Publications per year
2017–2026
540
Variants
Computational Complexity Analysis
1.9K
Practical Secure Aggregation for Privacy-Preserving Machine Learning
Keith Bonawitz, Vladimir Ivanov, Ben Kreuter et al. · 2017 · 3.4K citations
The complexity of relational query languages (Extended Abstract)
Moshe Y. Vardi · 1982 · 1.2K citations
Computing, Computer Science, Algebra +16
Learning to recommend with social trust ensemble
Hao Ma, Irwin King, Michael R. Lyu · 2009 · 869 citations
1–5 of 1.9K
4.8K
18
h-index
11
h-index
10
h-index
9
h-index
8
h-index
1–5 of 4.8K
1.6K

Centre National de la Recherche Scientifique
Paris, France
18 h-index
50 publications
1.4K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
18 h-index
34 publications
1.8K citations

TU Wien
Vienna, Austria
16 h-index
50 publications
1.1K citations
Tianjin University
Tianjin, China
14 h-index
40 publications
1.6K citations

Monash University Malaysia
Subang Jaya, Malaysia
14 h-index
38 publications
1K citations
Carnegie Mellon University
Pittsburgh, United States
13 h-index
24 publications
2.2K citations

Chinese Academy of Sciences
Beijing, China
13 h-index
28 publications
707 citations
Massachusetts Institute of Technology
Cambridge, United States
13 h-index
22 publications
1.5K citations
1–8 of 1.6K
Repository · 47 publications · 1.7K citations
21
h-index
25 publications · 1.2K citations
20
h-index
24 publications · 1.9K citations
18
h-index
22 publications · 757 citations
17
h-index
19 publications · 798 citations
16
h-index
1–5