Completeness is a property of a computational problem that belongs to the class of decision problems and distinguishes itself by being at least as hard as every other problem in a given complexity class, such that any problem in that class can be reduced to it in polynomial time.
2.9K
Publications
158.3K
Citations
7.4K
Authors
2.2K
Institutions
Publications per year
2017–2026
609
Publications
2.9K
Mining quantitative association rules in large relational tables
Ramakrishnan Srikant, Rakesh Agrawal · 1996 · 1.5K citations · Full text
Marianne L. Gjerstorff · Scandinavian Journal of Public Health · 2011 · 1.3K citations
1–5 of 2.9K
Authors
7.4K
- DS
17
h-index
- RF
10
h-index
- CN
10
h-index
- FE
8
h-index
- RG
7
h-index
1–5 of 7.4K
Institutions
2.2K
University of California, Berkeley
Berkeley, United States
28 h-index
63 publications
5.8K citations
Centre National de la Recherche Scientifique
Paris, France
28 h-index
118 publications
5.7K citations
Stanford University
Stanford, United States
26 h-index
61 publications
3.3K citations
University of Edinburgh
Edinburgh, United Kingdom
22 h-index
46 publications
4.6K citations
California Institute of Technology
Pasadena, United States
22 h-index
48 publications
7.2K citations
University of Oxford
Oxford, United Kingdom
21 h-index
54 publications
2.5K citations
Massachusetts Institute of Technology
Cambridge, United States
20 h-index
35 publications
4.4K citations
Cornell University
Ithaca, United States
20 h-index
42 publications
2.1K citations
1–8 of 2.2K
Venues
- Journal of Symbolic Logic
82 publications · 6.7K citations
40
h-index
- The Astronomical Journal
AJ · 42 publications · 4.7K citations
30
h-index
- The Astrophysical Journal
ApJ · 43 publications · 3.8K citations
30
h-index
- Monthly Notices of the Royal Astronomical Society
53 publications · 3.6K citations
29
h-index
- Theoretical Computer Science
25 publications · 2.7K citations
19
h-index
1–5