Computational Complexity Of Decomposition
Computational Complexity of Decomposition is a theoretical measure within algorithmic geometry that characterizes the asymptotic resource requirements, particularly time and space, associated with constructing a cell decomposition of a given space or geometric object.
925
Publications
49.6K
Citations
2.4K
Authors
833
Institutions
Publications per year
2017–2026
201
Parents
925
1–5 of 925
2.4K
6
h-index
6
h-index
6
h-index
5
h-index
5
h-index
1–5 of 2.4K
833
University of Illinois Urbana-Champaign
Urbana, United States
17 h-index
48 publications
3.5K citations
Nanyang Technological University
Singapore, Singapore
16 h-index
44 publications
2.9K citations

Tel Aviv University
Tel Aviv, Israel
15 h-index
26 publications
1.2K citations
Columbia University
New York, United States
14 h-index
27 publications
3.9K citations

Centre National de la Recherche Scientifique
Paris, France
14 h-index
30 publications
2.2K citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
12 h-index
25 publications
986 citations
University of California, Berkeley
Berkeley, United States
11 h-index
20 publications
1.5K citations
Tsinghua University
Beijing, China
11 h-index
32 publications
3.4K citations
1–8 of 833
42 publications · 2.5K citations
23
h-index
14 publications · 2.6K citations
14
h-index
Repository · 21 publications · 993 citations
13
h-index
TPAMI · 13 publications · 1.8K citations
13
h-index
14 publications · 946 citations
13
h-index
1–5