Class information for:
Level 1: COMMUNICATION COMPLEXITY//QUANTUM QUERY COMPLEXITY//NEGATION LIMITED CIRCUIT

Basic class information
Class id #P Avg. number of
references		 Database coverage
of references
12202 925 19.8 33%


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
181 3       DISCRETE MATHEMATICS//JOURNAL OF GRAPH THEORY//MATHEMATICS 56539
841 2             COMPUTATIONAL GEOMETRY//COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS//COMPUTER SCIENCE, THEORY & METHODS 11757
12202 1                   COMMUNICATION COMPLEXITY//QUANTUM QUERY COMPLEXITY//NEGATION LIMITED CIRCUIT 925

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 COMMUNICATION COMPLEXITY authKW 1049620 11% 32% 98
2 QUANTUM QUERY COMPLEXITY authKW 454901 2% 66% 21
3 NEGATION LIMITED CIRCUIT authKW 363107 1% 100% 11
4 CIRCUIT COMPLEXITY authKW 353027 4% 28% 38
5 BLOCK SENSITIVITY authKW 297087 1% 100% 9
6 COMPUTATIONAL COMPLEXITY journal 291595 6% 16% 54
7 ADVERSARY METHOD authKW 267377 1% 90% 9
8 FORMULA COMPLEXITY authKW 264078 1% 100% 8
9 THRESHOLD CIRCUITS authKW 251029 2% 45% 17
10 QUERY COMPLEXITY authKW 228208 2% 31% 22

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 37946 55% 0% 513
2 Computer Science, Information Systems 3441 16% 0% 150
3 Mathematics, Applied 3274 24% 0% 225
4 Mathematics 2794 25% 0% 228
5 Computer Science, Hardware & Architecture 1811 8% 0% 75
6 Computer Science, Software Engineering 1582 10% 0% 92
7 COMPUTER APPLICATIONS & CYBERNETICS 443 1% 0% 6
8 Logic 251 1% 0% 11
9 Computer Science, Artificial Intelligence 79 3% 0% 28
10 Physics, Mathematical 37 2% 0% 23

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 CAMBRIDGE 8 66019 0% 100% 2
2 ADV DEV ACT 33010 0% 100% 1
3 ADV DEV ACTIV 33010 0% 100% 1
4 CNRSUMR 5668INRIA 33010 0% 100% 1
5 COM SCI ALGORITHMS COMPLEX 1 33010 0% 100% 1
6 CS PRINCIPLES METHODOL 33010 0% 100% 1
7 FRAUD ANALYT GRP 33010 0% 100% 1
8 KOMPLEXITATSTHEORIE EFFIZIENTE ALFORITHMEN 33010 0% 100% 1
9 LEHRTSUHL MATH INFORMAT 33010 0% 100% 1
10 LIPUMR 5668UCBLINRIA 33010 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 COMPUTATIONAL COMPLEXITY 291595 6% 16% 54
2 SIAM JOURNAL ON COMPUTING 76909 9% 3% 82
3 INFORMATION PROCESSING LETTERS 33254 9% 1% 80
4 JOURNAL OF COMPUTER AND SYSTEM SCIENCES 31980 5% 2% 46
5 THEORETICAL COMPUTER SCIENCE 23250 9% 1% 87
6 VESTNIK MOSKOVSKOGO UNIVERSITETA SERIYA 1 MATEMATIKA MEKHANIKA 15423 2% 2% 22
7 COMBINATORICA 15324 3% 2% 25
8 QUANTUM INFORMATION & COMPUTATION 11059 2% 2% 17
9 ALGORITHMICA 9723 3% 1% 26
10 COMPUTERS AND ARTIFICIAL INTELLIGENCE 9140 1% 3% 11

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 COMMUNICATION COMPLEXITY 1049620 11% 32% 98 Search COMMUNICATION+COMPLEXITY Search COMMUNICATION+COMPLEXITY
2 QUANTUM QUERY COMPLEXITY 454901 2% 66% 21 Search QUANTUM+QUERY+COMPLEXITY Search QUANTUM+QUERY+COMPLEXITY
3 NEGATION LIMITED CIRCUIT 363107 1% 100% 11 Search NEGATION+LIMITED+CIRCUIT Search NEGATION+LIMITED+CIRCUIT
4 CIRCUIT COMPLEXITY 353027 4% 28% 38 Search CIRCUIT+COMPLEXITY Search CIRCUIT+COMPLEXITY
5 BLOCK SENSITIVITY 297087 1% 100% 9 Search BLOCK+SENSITIVITY Search BLOCK+SENSITIVITY
6 ADVERSARY METHOD 267377 1% 90% 9 Search ADVERSARY+METHOD Search ADVERSARY+METHOD
7 FORMULA COMPLEXITY 264078 1% 100% 8 Search FORMULA+COMPLEXITY Search FORMULA+COMPLEXITY
8 THRESHOLD CIRCUITS 251029 2% 45% 17 Search THRESHOLD+CIRCUITS Search THRESHOLD+CIRCUITS
9 QUERY COMPLEXITY 228208 2% 31% 22 Search QUERY+COMPLEXITY Search QUERY+COMPLEXITY
10 MONOTONE CIRCUITS 226342 1% 57% 12 Search MONOTONE+CIRCUITS Search MONOTONE+CIRCUITS

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 KORSHUNOV, AD , (2003) MONOTONE BOOLEAN FUNCTIONS.RUSSIAN MATHEMATICAL SURVEYS. VOL. 58. ISSUE 5. P. 929 -1001 61 71% 17
2 SHERSTOV, AA , (2016) THE MULTIPARTY COMMUNICATION COMPLEXITY OF SET DISJOINTNESS.SIAM JOURNAL ON COMPUTING. VOL. 45. ISSUE 4. P. 1450 -1489 23 88% 0
3 SHERSTOV, AA , (2012) STRONG DIRECT PRODUCT THEOREMS FOR QUANTUM COMMUNICATION AND QUERY COMPLEXITY.SIAM JOURNAL ON COMPUTING. VOL. 41. ISSUE 5. P. 1122-1165 22 76% 6
4 SHERSTOV, AA , (2011) THE PATTERN MATRIX METHOD.SIAM JOURNAL ON COMPUTING. VOL. 40. ISSUE 6. P. 1969 -2000 21 75% 10
5 GOOS, M , LOVETT, S , MEKA, R , WATSON, T , ZUCKERMAN, D , (2016) RECTANGLES ARE NONNEGATIVE JUNTAS.SIAM JOURNAL ON COMPUTING. VOL. 45. ISSUE 5. P. 1835 -1869 18 75% 0
6 SHERSTOV, AA , (2009) SEPARATING AC(0) FROM DEPTH-2 MAJORITY CIRCUITS.SIAM JOURNAL ON COMPUTING. VOL. 38. ISSUE 6. P. 2113 -2129 18 86% 11
7 JAIN, R , PERESZLENYI, A , YAO, PH , (2016) A DIRECT PRODUCT THEOREM FOR TWO-PARTY BOUNDED-ROUND PUBLIC-COIN COMMUNICATION COMPLEXITY.ALGORITHMICA. VOL. 76. ISSUE 3. P. 720 -748 14 88% 0
8 SHERSTOV, AA , (2011) THE UNBOUNDED-ERROR COMMUNICATION COMPLEXITY OF SYMMETRIC FUNCTIONS.COMBINATORICA. VOL. 31. ISSUE 5. P. 583-614 17 77% 1
9 BRAVERMAN, M , (2015) INTERACTIVE INFORMATION COMPLEXITY.SIAM JOURNAL ON COMPUTING. VOL. 44. ISSUE 6. P. 1698 -1739 14 78% 4
10 UENO, K , (2015) CANDIDATE BOOLEAN FUNCTIONS TOWARDS SUPER-QUADRATIC FORMULA SIZE.IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS. VOL. E98D. ISSUE 3. P. 524 -531 11 100% 0

Classes with closest relation at Level 1


Rank Class id link
1 34995 FLOOR OPERATION//MAX PROBLEM//PARITY TESTS
2 14808 ORDERED BINARY DECISION DIAGRAMS//BINARY DECISION DIAGRAMS//BRANCHING PROGRAMS
3 3519 RESOURCE BOUNDED MEASURE//POLYNOMIAL TIME HIERARCHY//COMPLEXITY CLASSES
4 7314 ZERO KNOWLEDGE//OBLIVIOUS TRANSFER//JOURNAL OF CRYPTOLOGY
5 34621 CONSTANT FAULTS//PRICED INFORMATION//READ ONCE CONTACT NETWORKS
6 22324 NEURON MOS//THRESHOLD LOGIC//NEURON MOS TRANSISTOR
7 27660 NULLITY//SINGULAR GRAPHS//NSSD
8 21604 QUANTUM FINITE AUTOMATA//QUANTUM AUTOMATA//QUANTUM FINITE AUTOMATON
9 4232 PAC LEARNING//LEARNING THEORY//COMPUTATIONAL LEARNING THEORY
10 19412 HEAVY HITTERS//DATA STREAMS//IP FLOWS

Go to start page