Class information for:
Level 1: RESOURCE BOUNDED MEASURE//POLYNOMIAL TIME HIERARCHY//COMPLEXITY CLASSES

Basic class information
Class id #P Avg. number of
references		 Database coverage
of references
3519 1967 21.3 36%


Bar chart of Publication_year

Last years might be incomplete

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
621 3       MEMBRANE COMPUTING//THEORETICAL COMPUTER SCIENCE//LOGIC 13680
1059 2             MEMBRANE COMPUTING//THEORETICAL COMPUTER SCIENCE//P SYSTEMS 10031
3519 1                   RESOURCE BOUNDED MEASURE//POLYNOMIAL TIME HIERARCHY//COMPLEXITY CLASSES 1967

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 RESOURCE BOUNDED MEASURE authKW 334520 1% 86% 25
2 POLYNOMIAL TIME HIERARCHY authKW 270917 1% 73% 24
3 COMPLEXITY CLASSES authKW 246106 2% 39% 41
4 COMPUTATIONAL COMPLEXITY authKW 218563 11% 7% 217
5 SPARSE SETS authKW 209539 1% 75% 18
6 MATHEMATICAL SYSTEMS THEORY journal 204198 3% 20% 65
7 BOOLEAN HIERARCHY authKW 187372 1% 93% 13
8 ABT THEORET INFORMAT address 174682 1% 49% 23
9 SIAM JOURNAL ON COMPUTING journal 172353 9% 6% 179
10 COUNTING CLASSES authKW 171935 1% 92% 12

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 160368 78% 1% 1532
2 Logic 6956 4% 1% 82
3 Computer Science, Hardware & Architecture 6089 10% 0% 199
4 Mathematics, Applied 6051 23% 0% 448
5 Computer Science, Information Systems 5615 14% 0% 281
6 Mathematics 2492 17% 0% 326
7 Computer Science, Software Engineering 935 5% 0% 108
8 COMPUTER APPLICATIONS & CYBERNETICS 20 0% 0% 2
9 Computer Science, Artificial Intelligence 11 1% 0% 25
10 Multidisciplinary Sciences 1 0% 0% 8

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 ABT THEORET INFORMAT 174682 1% 49% 23
2 LEHRSTUHL INFORMAT 4 78573 0% 56% 9
3 THEORET INFORMAT ABT 41389 0% 67% 4
4 CERTICOM 34923 0% 75% 3
5 FAK ELEKT INFORMAT 23280 0% 50% 3
6 DESIGN ARTI 20695 0% 67% 2
7 COMP SCI 17010 21% 0% 412
8 FAK ELEKTROTECH INFORMAT 4 16551 0% 27% 4
9 ABT DATENBANKEN AI 15522 0% 100% 1
10 ABT THEOR INFORM 15522 0% 100% 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 MATHEMATICAL SYSTEMS THEORY 204198 3% 20% 65
2 SIAM JOURNAL ON COMPUTING 172353 9% 6% 179
3 JOURNAL OF COMPUTER AND SYSTEM SCIENCES 164374 8% 7% 152
4 COMPUTATIONAL COMPLEXITY 163637 3% 18% 59
5 THEORETICAL COMPUTER SCIENCE 127780 15% 3% 297
6 INFORMATION AND COMPUTATION 100673 6% 6% 117
7 THEORY OF COMPUTING SYSTEMS 78905 4% 7% 71
8 INFORMATION PROCESSING LETTERS 62533 8% 3% 160
9 INFORMATION AND CONTROL 44076 2% 9% 31
10 CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE 41897 0% 30% 9

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 RESOURCE BOUNDED MEASURE 334520 1% 86% 25 Search RESOURCE+BOUNDED+MEASURE Search RESOURCE+BOUNDED+MEASURE
2 POLYNOMIAL TIME HIERARCHY 270917 1% 73% 24 Search POLYNOMIAL+TIME+HIERARCHY Search POLYNOMIAL+TIME+HIERARCHY
3 COMPLEXITY CLASSES 246106 2% 39% 41 Search COMPLEXITY+CLASSES Search COMPLEXITY+CLASSES
4 COMPUTATIONAL COMPLEXITY 218563 11% 7% 217 Search COMPUTATIONAL+COMPLEXITY Search COMPUTATIONAL+COMPLEXITY
5 SPARSE SETS 209539 1% 75% 18 Search SPARSE+SETS Search SPARSE+SETS
6 BOOLEAN HIERARCHY 187372 1% 93% 13 Search BOOLEAN+HIERARCHY Search BOOLEAN+HIERARCHY
7 COUNTING CLASSES 171935 1% 92% 12 Search COUNTING+CLASSES Search COUNTING+CLASSES
8 DISJOINT NP PAIRS 170743 1% 100% 11 Search DISJOINT+NP+PAIRS Search DISJOINT+NP+PAIRS
9 CIRCUIT COMPLEXITY 148959 2% 27% 36 Search CIRCUIT+COMPLEXITY Search CIRCUIT+COMPLEXITY
10 RELATIVIZATION 130292 1% 44% 19 Search RELATIVIZATION Search RELATIVIZATION

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 SPAKOWSKI, H , TRIPATHI, R , (2009) HIERARCHICAL UNAMBIGUITY.SIAM JOURNAL ON COMPUTING. VOL. 38. ISSUE 5. P. 2079 -2112 28 100% 1
2 SPAKOWSKI, H , TRIPATHI, R , (2008) HIERARCHICAL UNAMBIGUITY.SIAM JOURNAL ON COMPUTING. VOL. 38. ISSUE 5. P. 2079 -2112 28 100% 1
3 GOLDSMITH, J , OGIHARA, M , ROTHE, J , (2000) TALLY NP SETS AND EASY CENSUS FUNCTIONS.INFORMATION AND COMPUTATION. VOL. 158. ISSUE 1. P. 29 -52 35 100% 0
4 AMIR, A , BEIGEL, R , GASARCH, W , (2003) SOME CONNECTIONS BETWEEN BOUNDED QUERY CLASSES AND NON-UNIFORM COMPLEXITY.INFORMATION AND COMPUTATION. VOL. 186. ISSUE 1. P. 104 -139 30 100% 6
5 CAI, JY , CHAKARAVARTHY, VT , HEMASPAANDRA, LA , OGIHARA, M , (2005) COMPETING PROVERS YIELD IMPROVED KARP-LIPTON COLLAPSE RESULTS.INFORMATION AND COMPUTATION. VOL. 198. ISSUE 1. P. 1 -23 30 91% 17
6 HEMASPAANDRA, LA , HEMPEL, H , NICKELSEN, A , (2004) ALGEBRAIC PROPERTIES FOR SELECTOR FUNCTIONS.SIAM JOURNAL ON COMPUTING. VOL. 33. ISSUE 6. P. 1309 -1337 28 100% 1
7 YAMAKAMI, T , SUZUKI, T , (2005) RESOURCE BOUNDED IMMUNITY AND SIMPLICITY.THEORETICAL COMPUTER SCIENCE. VOL. 347. ISSUE 1-2. P. 90 -129 27 96% 3
8 AGRAWAL, M , ALLENDER, E , DATTA, S , (2000) ON TC0, AC(0), AND ARITHMETIC CIRCUITS.JOURNAL OF COMPUTER AND SYSTEM SCIENCES. VOL. 60. ISSUE 2. P. 395 -421 29 94% 21
9 HESSE, W , ALLENDER, E , BARRINGTON, DAM , (2002) UNIFORM CONSTANT-DEPTH THRESHOLD CIRCUITS FOR DIVISION AND ITERATED MULTIPLICATION.JOURNAL OF COMPUTER AND SYSTEM SCIENCES. VOL. 65. ISSUE 4. P. 695 -716 27 87% 58
10 ALLENDER, E , (2006) NL-PRINTABLE SETS AND NONDETERMINISTIC KOLMOGOROV COMPLEXITY.THEORETICAL COMPUTER SCIENCE. VOL. 355. ISSUE 2. P. 127 -138 24 92% 2

Classes with closest relation at Level 1


Rank Class id link
1 21604 QUANTUM FINITE AUTOMATA//QUANTUM AUTOMATA//QUANTUM FINITE AUTOMATON
2 13494 FINITE MODEL THEORY//DESCRIPTIVE COMPLEXITY//CONSTRAINT DATABASES
3 12202 COMMUNICATION COMPLEXITY//QUANTUM QUERY COMPLEXITY//NEGATION LIMITED CIRCUIT
4 7314 ZERO KNOWLEDGE//OBLIVIOUS TRANSFER//JOURNAL OF CRYPTOLOGY
5 14361 BOUNDED ARITHMETIC//PROOF COMPLEXITY//PROPOSITIONAL PROOF COMPLEXITY
6 8238 ALGORITHMIC RANDOMNESS//TURING DEGREES//KOLMOGOROV COMPLEXITY
7 25940 PICTURE LANGUAGES//TWO DIMENSIONAL LANGUAGES//2D LANGUAGES
8 21058 CONJUNCTIVE GRAMMARS//LANGUAGE EQUATIONS//FIRING SQUAD SYNCHRONIZATION PROBLEM
9 11887 STATE COMPLEXITY//DESCRIPTIONAL COMPLEXITY//FINITE AUTOMATA
10 12335 LIST RANKING//PARALLEL ALGORITHMS//PLANAR DIRECTED GRAPHS

Go to start page