Class information for:
Level 1: RESOURCE BOUNDED MEASURE//COMPUTATIONAL COMPLEXITY//DISJOINT NP PAIRS

Basic class information
ID Publications Average number
of references		 Avg. shr. active
ref. in WoS
2777 2076 22.1 36%


Bar chart of Publication_year

Last years might be incomplete

Classes in level above (level 2)


ID, lev.
above		 Publications Label for level above
1160 9033 MEMBRANE COMPUTING//GRP NAT COMP//THEORETICAL COMPUTER SCIENCE

Terms with highest relevance score


Rank Term Type of term Relevance score
(tfidf)		 Class's shr.
of term's tot.
occurrences		 Shr. of publ.
in class containing
term		 Num. of
publ. in
class
1 RESOURCE BOUNDED MEASURE Author keyword 72 93% 1% 27
2 COMPUTATIONAL COMPLEXITY Journal 31 29% 4% 89
3 DISJOINT NP PAIRS Author keyword 26 100% 1% 11
4 BOOLEAN HIERARCHY Author keyword 26 87% 1% 13
5 SPARSE SETS Author keyword 25 75% 1% 18
6 COUNTING CLASSES Author keyword 23 86% 1% 12
7 COMPLEXITY CLASSES Author keyword 23 41% 2% 44
8 CIRCUIT COMPLEXITY Author keyword 22 36% 2% 51
9 POLYNOMIAL TIME HIERARCHY Author keyword 20 66% 1% 19
10 SELF REDUCIBILITY Author keyword 20 100% 0% 9

Web of Science journal categories

Author Key Words


Rank Web of Science journal category Relevance score
(tfidf)		 Class's shr.
of term's tot.
occurrences		 Shr. of publ.
in class containing
term		 Num. of
publ. in
class		 LCSH search Wikipedia search
1 RESOURCE BOUNDED MEASURE 72 93% 1% 27 Search RESOURCE+BOUNDED+MEASURE Search RESOURCE+BOUNDED+MEASURE
2 DISJOINT NP PAIRS 26 100% 1% 11 Search DISJOINT+NP+PAIRS Search DISJOINT+NP+PAIRS
3 BOOLEAN HIERARCHY 26 87% 1% 13 Search BOOLEAN+HIERARCHY Search BOOLEAN+HIERARCHY
4 SPARSE SETS 25 75% 1% 18 Search SPARSE+SETS Search SPARSE+SETS
5 COUNTING CLASSES 23 86% 1% 12 Search COUNTING+CLASSES Search COUNTING+CLASSES
6 COMPLEXITY CLASSES 23 41% 2% 44 Search COMPLEXITY+CLASSES Search COMPLEXITY+CLASSES
7 CIRCUIT COMPLEXITY 22 36% 2% 51 Search CIRCUIT+COMPLEXITY Search CIRCUIT+COMPLEXITY
8 POLYNOMIAL TIME HIERARCHY 20 66% 1% 19 Search POLYNOMIAL+TIME+HIERARCHY Search POLYNOMIAL+TIME+HIERARCHY
9 SELF REDUCIBILITY 20 100% 0% 9 Search SELF+REDUCIBILITY Search SELF+REDUCIBILITY
10 AUTOREDUCIBILITY 18 89% 0% 8 Search AUTOREDUCIBILITY Search AUTOREDUCIBILITY

Key Words Plus


Rank Web of Science journal category Relevance score
(tfidf)		 Class's shr.
of term's tot.
occurrences		 Shr. of publ.
in class containing
term		 Num. of
publ. in
class
1 COMPLEXITY CLASSES 158 69% 7% 136
2 SPARSE SETS 85 85% 2% 45
3 POLYNOMIAL TIME HIERARCHY 79 69% 3% 67
4 BOOLEAN HIERARCHY 62 73% 2% 47
5 COUNTING CLASSES 62 90% 1% 27
6 RELATIVIZATIONS 53 89% 1% 24
7 SELF REDUCIBILITY 52 100% 1% 18
8 NP 49 23% 9% 184
9 SPARSE ORACLES 44 100% 1% 16
10 REDUCIBILITIES 25 77% 1% 17

Journals


Rank Web of Science journal category Relevance score
(tfidf)		 Class's shr.
of term's tot.
occurrences		 Shr. of publ.
in class containing
term		 Num. of
publ. in
class
1 COMPUTATIONAL COMPLEXITY 31 29% 4% 89
2 MATHEMATICAL SYSTEMS THEORY 14 19% 3% 63

Reviews


Title Publ. year Cit. Active
references		 % act. ref.
to same field
LOGIC MEETS ALGEBRA: THE CASE OF REGULAR LANGUAGES 2007 1 57 39%
COMPLEXITY CLASSES 1989 0 14 79%
CLASSIFYING THE COMPUTATIONAL-COMPLEXITY OF PROBLEMS 1987 29 49 37%

Address terms


Rank Address term Relevance score
(tfidf)		 Class's shr.
of term's tot.
occurrences		 Shr. of publ.
in class containing
term		 Num. of
publ. in
class
1 ABT THEORET INFORMAT 16 50% 1.1% 23
2 LEHRSTUHL INFORMAT 4 7 56% 0.4% 9
3 CERTICOM 4 75% 0.1% 3
4 THEORET INFORMAT ABT 4 75% 0.1% 3
5 DESIGN ARTI 2 67% 0.1% 2
6 FAK ELEKT INFORMAT 2 50% 0.1% 3
7 FAK ELEKTROTECH INFORMAT 4 1 27% 0.2% 4
8 LEHRSTUHL THEORET INFORMAT 1 17% 0.2% 5
9 GEN EDUC MATH CHIKUSA KU 1 50% 0.0% 1
10 INTERDEPARTMENTAL PROGRAM BIOINFORMAT COMP 1 50% 0.0% 1

Related classes at same level (level 1)


Rank Relatedness score Related classes
1 0.0000199169 QUANTUM FINITE AUTOMATA//QUANTUM AUTOMATA//TWO DIMENSIONAL ALTERNATING TURING MACHINE
2 0.0000143944 NEGATION LIMITED CIRCUIT//COMMUNICATION COMPLEXITY//MULTIPARTY COMMUNICATION COMPLEXITY
3 0.0000128064 FINITE MODEL THEORY//DEPENDENCE LOGIC//DESCRIPTIVE COMPLEXITY
4 0.0000108393 PROPERTY TESTING//PROBABILISTICALLY CHECKABLE PROOFS//SUBLINEAR ALGORITHMS
5 0.0000095837 GRAPH COVERING//EXTRACTORS//IHARA ZETA FUNCTION
6 0.0000095584 BOUNDED ARITHMETIC//PROOF COMPLEXITY//PROPOSITIONAL PROOF COMPLEXITY
7 0.0000083420 NEURON MOS//NEURON MOS TRANSISTOR//THRESHOLD LOGIC
8 0.0000081148 TURING DEGREES//ALGORITHMIC RANDOMNESS//COMPUTABLY ENUMERABLE
9 0.0000075117 POLYNOMIAL FACTORIZATION//ABSOLUTE IRREDUCIBILITY//POLYNOMIAL IDENTITY TESTING
10 0.0000074992 RANDOM ACCESS MACHINE//FLOOR OPERATION//MAX PROBLEM