Class information for: |
Basic class information |
Class id | #P | Avg. number of references |
Database coverage of references |
---|---|---|---|
27012 | 240 | 17.8 | 30% |
Hierarchy of classes |
The table includes all classes above and classes immediately below the current class. |
Cluster id | Level | Cluster label | #P |
---|---|---|---|
9 | 4 | COMPUTER SCIENCE, THEORY & METHODS//COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE//COMPUTER SCIENCE, INFORMATION SYSTEMS | 1247339 |
295 | 3 | CRYPTOGRAPHY//COMPUTER SCIENCE, THEORY & METHODS//IEEE TRANSACTIONS ON INFORMATION THEORY | 41419 |
1707 | 2 | JOURNAL OF SYMBOLIC COMPUTATION//SCALAR MULTIPLICATION//FINITE FIELDS | 6697 |
27012 | 1 | TRIANGLE COUNTING//TRIANGLE LISTING//QUADRATIC ALGORITHMS | 240 |
Terms with highest relevance score |
rank | Term | termType | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|---|
1 | TRIANGLE COUNTING | authKW | 572535 | 3% | 75% | 6 |
2 | TRIANGLE LISTING | authKW | 508922 | 2% | 100% | 4 |
3 | QUADRATIC ALGORITHMS | authKW | 381692 | 1% | 100% | 3 |
4 | RECTANGULAR MATRIX MULTIPLICATION | authKW | 339279 | 2% | 67% | 4 |
5 | BILINEAR ALGORITHM | authKW | 286267 | 1% | 75% | 3 |
6 | MULTIPLICATIVE COMPLEXITY | authKW | 259753 | 3% | 29% | 7 |
7 | COUNTING AND DETECTION OF SUBGRAPHS | authKW | 254461 | 1% | 100% | 2 |
8 | SUBGRAPH AND INDUCED SUBGRAPH ISOMORPHISM | authKW | 254461 | 1% | 100% | 2 |
9 | TRIANGLE CHARACTERISTICS | authKW | 254461 | 1% | 100% | 2 |
10 | BOOLEAN MATRIX MULTIPLICATION | authKW | 254457 | 2% | 50% | 4 |
Web of Science journal categories |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | Computer Science, Theory & Methods | 8251 | 51% | 0% | 122 |
2 | Mathematics, Applied | 2739 | 43% | 0% | 102 |
3 | Computer Science, Information Systems | 803 | 15% | 0% | 37 |
4 | Computer Science, Software Engineering | 532 | 11% | 0% | 27 |
5 | Logic | 300 | 3% | 0% | 6 |
6 | Mathematics | 213 | 14% | 0% | 34 |
7 | COMPUTER APPLICATIONS & CYBERNETICS | 191 | 1% | 0% | 2 |
8 | Computer Science, Hardware & Architecture | 91 | 4% | 0% | 9 |
9 | Computer Science, Artificial Intelligence | 56 | 5% | 0% | 11 |
10 | Automation & Control Systems | 9 | 2% | 0% | 4 |
Address terms |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | BASIC SOFTWARE DEV 1 | 127231 | 0% | 100% | 1 |
2 | CHAIR INFORMAT TECHNOL EDUC | 127231 | 0% | 100% | 1 |
3 | OPTIMIZAT INVESTMENT ENGN | 127231 | 0% | 100% | 1 |
4 | MORRIS ROSE GOLDMAN CAREER DEV CHAIR | 63614 | 0% | 50% | 1 |
5 | THEORET INFORMAT | 27391 | 4% | 2% | 9 |
6 | RUSSIAN FED FORENS SCI | 18174 | 0% | 14% | 1 |
7 | NLE | 15902 | 0% | 13% | 1 |
8 | ORCCA | 15902 | 0% | 13% | 1 |
9 | MADALGO MASS DATA ALGORITHM | 14135 | 0% | 11% | 1 |
10 | DISCRETE MATH ITS PLICAT DIM | 7066 | 0% | 6% | 1 |
Journals |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | SIAM JOURNAL ON COMPUTING | 25399 | 10% | 1% | 24 |
2 | JOURNAL OF ALGORITHMS | 13620 | 3% | 2% | 6 |
3 | INFORMATION PROCESSING LETTERS | 7226 | 8% | 0% | 19 |
4 | COMPUTATIONAL COMPLEXITY | 6161 | 2% | 1% | 4 |
5 | THEORETICAL COMPUTER SCIENCE | 5729 | 9% | 0% | 22 |
6 | JOURNAL OF COMPLEXITY | 5699 | 3% | 1% | 6 |
7 | ALGORITHMICA | 5553 | 4% | 0% | 10 |
8 | JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 5513 | 3% | 1% | 6 |
9 | ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA | 5152 | 1% | 1% | 3 |
10 | LECTURE NOTES IN COMPUTER SCIENCE | 1529 | 14% | 0% | 33 |
Author Key Words |
Core articles |
The table includes core articles in the class. The following variables is taken into account for the relevance score of an article in a cluster c: (1) Number of references referring to publications in the class. (2) Share of total number of active references referring to publications in the class. (3) Age of the article. New articles get higher score than old articles. (4) Citation rate, normalized to year. |
Rank | Reference | # ref. in cl. |
Shr. of ref. in cl. |
Citations |
---|---|---|---|---|
1 | CZUMAJ, A , LINGAS, A , (2009) FINDING A HEAVIEST VERTEX-WEIGHTED TRIANGLE IS NOT HARDER THAN MATRIX MULTIPLICATION.SIAM JOURNAL ON COMPUTING. VOL. 39. ISSUE 2. P. 431 -444 | 10 | 100% | 3 |
2 | KAMINSKI, M , (2005) A LOWER BOUND ON THE COMPLEXITY OF POLYNOMIAL MULTIPLICATION OVER FINITE FIELDS.SIAM JOURNAL ON COMPUTING. VOL. 34. ISSUE 4. P. 960 -992 | 11 | 92% | 4 |
3 | BLASER, M , (2005) BEYOND THE ALDER-STRASSEN BOUND.THEORETICAL COMPUTER SCIENCE. VOL. 331. ISSUE 1. P. 3 -21 | 11 | 92% | 3 |
4 | BLASER, M , DE VOLTAIRE, AM , (2009) SEMISIMPLE ALGEBRAS OF ALMOST MINIMAL RANK OVER THE REALS.THEORETICAL COMPUTER SCIENCE. VOL. 410. ISSUE 50. P. 5202-5214 | 9 | 100% | 0 |
5 | BLASER, M , (2004) A COMPLETE CHARACTERIZATION OF THE ALGEBRAS OF MINIMAL BILINEAR COMPLEXITY.SIAM JOURNAL ON COMPUTING. VOL. 34. ISSUE 2. P. 277 -298 | 10 | 91% | 4 |
6 | DAVIE, AM , STOTHERS, AJ , (2013) IMPROVED BOUND FOR COMPLEXITY OF MATRIX MULTIPLICATION.PROCEEDINGS OF THE ROYAL SOCIETY OF EDINBURGH SECTION A-MATHEMATICS. VOL. 143. ISSUE 2. P. 351-369 | 7 | 88% | 16 |
7 | COHEN, K , YUSTER, R , (2014) ON MINIMUM WITNESSES FOR BOOLEAN MATRIX MULTIPLICATION.ALGORITHMICA. VOL. 69. ISSUE 2. P. 431 -442 | 8 | 80% | 1 |
8 | DREVET, CE , ISLAM, MN , SCHOST, E , (2011) OPTIMIZATION TECHNIQUES FOR SMALL MATRIX MULTIPLICATION.THEORETICAL COMPUTER SCIENCE. VOL. 412. ISSUE 22. P. 2219-2236 | 11 | 61% | 3 |
9 | BSHOUTY, NH , (1995) MULTIPLICATIVE COMPLEXITY OF DIRECT SUMS OF QUADRATIC SYSTEMS.LINEAR ALGEBRA AND ITS APPLICATIONS. VOL. 215. ISSUE . P. 183-223 | 12 | 92% | 0 |
10 | LINGAS, A , (2011) A FAST OUTPUT-SENSITIVE ALGORITHM FOR BOOLEAN MATRIX MULTIPLICATION.ALGORITHMICA. VOL. 61. ISSUE 1. P. 36-50 | 8 | 73% | 5 |
Classes with closest relation at Level 1 |