Class information for: |
Basic class information |
Class id | #P | Avg. number of references |
Database coverage of references |
---|---|---|---|
34995 | 103 | 15.0 | 25% |
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 |
181 | 3 | DISCRETE MATHEMATICS//JOURNAL OF GRAPH THEORY//MATHEMATICS | 56539 |
841 | 2 | COMPUTATIONAL GEOMETRY//COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS//COMPUTER SCIENCE, THEORY & METHODS | 11757 |
34995 | 1 | FLOOR OPERATION//MAX PROBLEM//PARITY TESTS | 103 |
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 | FLOOR OPERATION | authKW | 592925 | 2% | 100% | 2 |
2 | MAX PROBLEM | authKW | 592925 | 2% | 100% | 2 |
3 | PARITY TESTS | authKW | 592925 | 2% | 100% | 2 |
4 | MOD OPERATION | authKW | 395282 | 2% | 67% | 2 |
5 | RANDOM ACCESS MACHINE | authKW | 338808 | 4% | 29% | 4 |
6 | ARBITRARY NUMBER | authKW | 296462 | 1% | 100% | 1 |
7 | CELL PROBE LOWER BOUNDS | authKW | 296462 | 1% | 100% | 1 |
8 | COMPARE BY HASH | authKW | 296462 | 1% | 100% | 1 |
9 | COMPLEXITY OF LOOP PROGRAMS | authKW | 296462 | 1% | 100% | 1 |
10 | COMPONENT COUNTING ARGUMENTS | authKW | 296462 | 1% | 100% | 1 |
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 | 6193 | 67% | 0% | 69 |
2 | Computer Science, Information Systems | 882 | 24% | 0% | 25 |
3 | Logic | 496 | 5% | 0% | 5 |
4 | Computer Science, Software Engineering | 447 | 16% | 0% | 16 |
5 | Mathematics, Applied | 333 | 23% | 0% | 24 |
6 | Computer Science, Hardware & Architecture | 293 | 10% | 0% | 10 |
7 | COMPUTER APPLICATIONS & CYBERNETICS | 112 | 1% | 0% | 1 |
8 | Mathematics | 38 | 10% | 0% | 10 |
9 | Computer Science, Cybernetics | 9 | 1% | 0% | 1 |
10 | Computer Science, Artificial Intelligence | 3 | 2% | 0% | 2 |
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 | IMECC DCC | 296462 | 1% | 100% | 1 |
2 | PROGRAM LOGIC ALGORITHIMS COMPUTAT | 296462 | 1% | 100% | 1 |
3 | INFORMAT SECUR CRYPTOL | 49409 | 1% | 17% | 1 |
4 | AUTOMATA THEORY GRP | 42350 | 1% | 14% | 1 |
5 | ALGORITHM COMPLEXITE LOG | 37056 | 1% | 13% | 1 |
6 | UNIV PARIS EST | 8718 | 1% | 3% | 1 |
7 | LACL | 3086 | 1% | 1% | 1 |
8 | IT | 2400 | 3% | 0% | 3 |
9 | COMP SCI MATH | 1508 | 3% | 0% | 3 |
10 | HEINZ NIXDORF | 1322 | 1% | 0% | 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 | CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE | 9880 | 1% | 3% | 1 |
2 | THEORETICAL COMPUTER SCIENCE | 8969 | 17% | 0% | 18 |
3 | COMPUTATIONAL COMPLEXITY | 8079 | 3% | 1% | 3 |
4 | JOURNAL OF THE ACM | 7483 | 6% | 0% | 6 |
5 | INFORMATION PROCESSING LETTERS | 6728 | 12% | 0% | 12 |
6 | INFORMATION AND COMPUTATION | 5056 | 6% | 0% | 6 |
7 | ACM TRANSACTIONS ON COMPUTATIONAL LOGIC | 3645 | 2% | 1% | 2 |
8 | ACTA INFORMATICA | 2385 | 3% | 0% | 3 |
9 | PROBLEMS OF CONTROL AND INFORMATION THEORY-PROBLEMY UPRAVLENIYA I TEORII INFORMATSII | 1817 | 1% | 1% | 1 |
10 | SIAM JOURNAL ON COMPUTING | 1639 | 4% | 0% | 4 |
Author Key Words |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
LCSH search | Wikipedia search |
---|---|---|---|---|---|---|---|
1 | FLOOR OPERATION | 592925 | 2% | 100% | 2 | Search FLOOR+OPERATION | Search FLOOR+OPERATION |
2 | MAX PROBLEM | 592925 | 2% | 100% | 2 | Search MAX+PROBLEM | Search MAX+PROBLEM |
3 | PARITY TESTS | 592925 | 2% | 100% | 2 | Search PARITY+TESTS | Search PARITY+TESTS |
4 | MOD OPERATION | 395282 | 2% | 67% | 2 | Search MOD+OPERATION | Search MOD+OPERATION |
5 | RANDOM ACCESS MACHINE | 338808 | 4% | 29% | 4 | Search RANDOM+ACCESS+MACHINE | Search RANDOM+ACCESS+MACHINE |
6 | ARBITRARY NUMBER | 296462 | 1% | 100% | 1 | Search ARBITRARY+NUMBER | Search ARBITRARY+NUMBER |
7 | CELL PROBE LOWER BOUNDS | 296462 | 1% | 100% | 1 | Search CELL+PROBE+LOWER+BOUNDS | Search CELL+PROBE+LOWER+BOUNDS |
8 | COMPARE BY HASH | 296462 | 1% | 100% | 1 | Search COMPARE+BY+HASH | Search COMPARE+BY+HASH |
9 | COMPLEXITY OF LOOP PROGRAMS | 296462 | 1% | 100% | 1 | Search COMPLEXITY+OF+LOOP+PROGRAMS | Search COMPLEXITY+OF+LOOP+PROGRAMS |
10 | COMPONENT COUNTING ARGUMENTS | 296462 | 1% | 100% | 1 | Search COMPONENT+COUNTING+ARGUMENTS | Search COMPONENT+COUNTING+ARGUMENTS |
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 | MATOS, AB , (2015) THE EFFICIENCY OF PRIMITIVE RECURSIVE FUNCTIONS: A PROGRAMMER'S VIEW.THEORETICAL COMPUTER SCIENCE. VOL. 594. ISSUE . P. 65 -81 | 6 | 100% | 0 |
2 | VAN DEN DRIES, L , MOSCHOVAKIS, YN , (2009) ARITHMETIC COMPLEXITY.ACM TRANSACTIONS ON COMPUTATIONAL LOGIC. VOL. 10. ISSUE 1. P. - | 6 | 86% | 1 |
3 | BRAND, M , (2015) ARBITRARY SEQUENCE RAMS.INFORMATION PROCESSING LETTERS. VOL. 115. ISSUE 2. P. 193 -198 | 4 | 100% | 0 |
4 | BEN-AMRAM, AM , GALIL, Z , (2002) TOPOLOGICAL LOWER BOUNDS ON ALGEBRAIC RANDOM ACCESS MACHINES.SIAM JOURNAL ON COMPUTING. VOL. 31. ISSUE 3. P. 722 -761 | 7 | 78% | 1 |
5 | DAVID, R , (2003) DECIDABILITY RESULTS FOR PRIMITIVE RECURSIVE ALGORITHMS.THEORETICAL COMPUTER SCIENCE. VOL. 300. ISSUE 1-3. P. 477-504 | 6 | 86% | 0 |
6 | FLEISCHER, R , (1999) DECISION TREES: OLD AND NEW RESULTS.INFORMATION AND COMPUTATION. VOL. 152. ISSUE 1. P. 44 -61 | 9 | 64% | 4 |
7 | DAVID, R , (2001) ON THE ASYMPTOTIC BEHAVIOUR OF PRIMITIVE RECURSIVE ALGORITHMS.THEORETICAL COMPUTER SCIENCE. VOL. 266. ISSUE 1-2. P. 159-193 | 6 | 86% | 2 |
8 | MANSOUR, Y , SCHIEBER, B , TIWARI, P , (1991) LOWER BOUNDS FOR COMPUTATIONS WITH THE FLOOR OPERATION.SIAM JOURNAL ON COMPUTING. VOL. 20. ISSUE 2. P. 315 -327 | 8 | 89% | 10 |
9 | BSHOUTY, NH , (1999) LOWER BOUNDS FOR THE COMPLEXITY OF FUNCTIONS IN A REALISTIC RAM MODEL.JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC. VOL. 32. ISSUE 1. P. 1-20 | 6 | 86% | 0 |
10 | COLSON, L , FREDHOLM, D , (1998) SYSTEM T, CALL-BY-VALUE AND THE MINIMUM PROBLEM.THEORETICAL COMPUTER SCIENCE. VOL. 206. ISSUE 1-2. P. 301 -315 | 5 | 100% | 5 |
Classes with closest relation at Level 1 |