Class information for:
Level 1: BOUNDED ARITHMETIC//PROOF COMPLEXITY//PROPOSITIONAL PROOF COMPLEXITY

Basic class information
Class id #P Avg. number of
references		 Database coverage
of references
14361 774 19.9 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
75 3       OPERATIONS RESEARCH & MANAGEMENT SCIENCE//ENGINEERING, INDUSTRIAL//EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 81966
1890 2             CONSTRAINTS//BOUNDED ARITHMETIC//PROOF COMPLEXITY 5963
14361 1                   BOUNDED ARITHMETIC//PROOF COMPLEXITY//PROPOSITIONAL PROOF COMPLEXITY 774

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 BOUNDED ARITHMETIC authKW 2954015 11% 90% 83
2 PROOF COMPLEXITY authKW 2347403 11% 73% 82
3 PROPOSITIONAL PROOF COMPLEXITY authKW 850208 3% 86% 25
4 POLYNOMIAL CALCULUS authKW 591750 2% 100% 15
5 INTERPRETABILITY LOGIC authKW 476216 2% 93% 13
6 LOGIC WoSSC 377613 48% 3% 375
7 PIGEONHOLE PRINCIPLE authKW 355044 2% 75% 12
8 WEAK PIGEONHOLE PRINCIPLE authKW 315600 1% 100% 8
9 FREGE PROOFS authKW 236700 1% 100% 6
10 CONSERVATION RESULTS authKW 202884 1% 86% 6

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 Logic 377613 48% 3% 375
2 Mathematics 14365 59% 0% 453
3 Computer Science, Theory & Methods 10739 33% 0% 252
4 Mathematics, Applied 3148 26% 0% 201
5 Computer Science, Hardware & Architecture 498 5% 0% 37
6 Computer Science, Artificial Intelligence 361 6% 0% 48
7 Computer Science, Information Systems 203 5% 0% 37
8 Computer Science, Software Engineering 195 4% 0% 32
9 Philosophy 174 3% 0% 20
10 History & Philosophy of Science 1 0% 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 ALGEBRA COMPUTAT MATH 52595 1% 33% 4
2 ABT TEORET INFORMAT 39450 0% 100% 1
3 ALEGBRA 39450 0% 100% 1
4 CIENCIAS COMPUTAC E1A 39450 0% 100% 1
5 CIENCIAS COMPUTAT INTELIGENT ARTIFICIAL 39450 0% 100% 1
6 CNRS URA 753 39450 0% 100% 1
7 COMPUTING SOFTWARE 39450 0% 100% 1
8 DOCTORAL PROGRAM COMP SCI MATH PHILOSOPHY 39450 0% 100% 1
9 ECIPGSIS 39450 0% 100% 1
10 FB 17 MATH INFORM 39450 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 ANNALS OF PURE AND APPLIED LOGIC 183824 13% 5% 98
2 ARCHIVE FOR MATHEMATICAL LOGIC 147517 8% 6% 60
3 JOURNAL OF SYMBOLIC LOGIC 125487 12% 3% 96
4 MATHEMATICAL LOGIC QUARTERLY 59144 5% 4% 42
5 COMPUTATIONAL COMPLEXITY 43120 2% 6% 19
6 ACM TRANSACTIONS ON COMPUTATIONAL LOGIC 31044 2% 5% 16
7 ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK 9622 1% 2% 11
8 LOGICAL METHODS IN COMPUTER SCIENCE 8965 2% 2% 12
9 NOTRE DAME JOURNAL OF FORMAL LOGIC 8177 1% 3% 7
10 JOURNAL OF LOGIC AND COMPUTATION 6948 2% 1% 13

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 BOUNDED ARITHMETIC 2954015 11% 90% 83 Search BOUNDED+ARITHMETIC Search BOUNDED+ARITHMETIC
2 PROOF COMPLEXITY 2347403 11% 73% 82 Search PROOF+COMPLEXITY Search PROOF+COMPLEXITY
3 PROPOSITIONAL PROOF COMPLEXITY 850208 3% 86% 25 Search PROPOSITIONAL+PROOF+COMPLEXITY Search PROPOSITIONAL+PROOF+COMPLEXITY
4 POLYNOMIAL CALCULUS 591750 2% 100% 15 Search POLYNOMIAL+CALCULUS Search POLYNOMIAL+CALCULUS
5 INTERPRETABILITY LOGIC 476216 2% 93% 13 Search INTERPRETABILITY+LOGIC Search INTERPRETABILITY+LOGIC
6 PIGEONHOLE PRINCIPLE 355044 2% 75% 12 Search PIGEONHOLE+PRINCIPLE Search PIGEONHOLE+PRINCIPLE
7 WEAK PIGEONHOLE PRINCIPLE 315600 1% 100% 8 Search WEAK+PIGEONHOLE+PRINCIPLE Search WEAK+PIGEONHOLE+PRINCIPLE
8 FREGE PROOFS 236700 1% 100% 6 Search FREGE+PROOFS Search FREGE+PROOFS
9 CONSERVATION RESULTS 202884 1% 86% 6 Search CONSERVATION+RESULTS Search CONSERVATION+RESULTS
10 FREGE PROOF SYSTEMS 197250 1% 100% 5 Search FREGE+PROOF+SYSTEMS Search FREGE+PROOF+SYSTEMS

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 NORDSTROM, J , (2013) PEBBLE GAMES, PROOF COMPLEXITY, AND TIME-SPACETRADE-OFFS.LOGICAL METHODS IN COMPUTER SCIENCE. VOL. 9. ISSUE 3. P. - 51 93% 2
2 SEGERLIND, N , (2007) THE COMPLEXITY OF PROPOSITIONAL PROOFS.BULLETIN OF SYMBOLIC LOGIC. VOL. 13. ISSUE 4. P. 417 -481 50 79% 22
3 BUSS, SR , KOLODZIEJCZYK, LA , THAPEN, N , (2014) FRAGMENTS OF APPROXIMATE COUNTING.JOURNAL OF SYMBOLIC LOGIC. VOL. 79. ISSUE 2. P. 496 -525 21 100% 2
4 NORDSTROM, J , (2012) ON THE RELATIVE STRENGTH OF PEBBLING AND RESOLUTION.ACM TRANSACTIONS ON COMPUTATIONAL LOGIC. VOL. 13. ISSUE 2. P. - 23 92% 0
5 SKELLEY, A , THAPEN, N , (2011) THE PROVABLY TOTAL SEARCH PROBLEMS OF BOUNDED ARITHMETIC.PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY. VOL. 103. ISSUE . P. 106 -138 23 92% 2
6 ATSERIAS, A , MULLER, M , OLIVA, S , (2015) LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE.JOURNAL OF SYMBOLIC LOGIC. VOL. 80. ISSUE 2. P. 450 -476 21 91% 0
7 NORDSTROM, J , (2009) NARROW PROOFS MAY BE SPACIOUS: SEPARATING SPACE AND WIDTH IN RESOLUTION.SIAM JOURNAL ON COMPUTING. VOL. 39. ISSUE 1. P. 59 -121 23 88% 7
8 ATSERIAS, A , LAURIA, M , NORDSTROM, J , (2016) NARROW PROOFS MAY BE MAXIMALLY LONG.ACM TRANSACTIONS ON COMPUTATIONAL LOGIC. VOL. 17. ISSUE 3. P. - 23 74% 0
9 BUSS, SR , (2012) TOWARDS NP-P VIA PROOF COMPLEXITY AND SEARCH.ANNALS OF PURE AND APPLIED LOGIC. VOL. 163. ISSUE 7. P. 906 -917 31 58% 4
10 BONACINA, I , GALESI, N , (2015) A FRAMEWORK FOR SPACE COMPLEXITY IN ALGEBRAIC PROOF SYSTEMS.JOURNAL OF THE ACM. VOL. 62. ISSUE 3. P. - 16 100% 0

Classes with closest relation at Level 1


Rank Class id link
1 20487 QUANTIFIED BOOLEAN FORMULAS//MAX SAT//CONFIGURATION CHECKING
2 13423 REVERSE MATHEMATICS//LOGIC//FUNCTIONAL INTERPRETATION
3 22155 JUSTIFICATION LOGIC//LOGIC OF PROOFS//REALIZATION THEOREM
4 16656 DUALIZATION//RUTCOR//HYPERGRAPH TRANSVERSALS
5 3519 RESOURCE BOUNDED MEASURE//POLYNOMIAL TIME HIERARCHY//COMPLEXITY CLASSES
6 9328 LINEAR LOGIC//IMPLICIT COMPUTATIONAL COMPLEXITY//COMPUTABILITY LOGIC
7 12202 COMMUNICATION COMPLEXITY//QUANTUM QUERY COMPLEXITY//NEGATION LIMITED CIRCUIT
8 8098 MESSAGE PASSING ALGORITHMS//CAVITY AND REPLICA METHOD//NUMBER PARTITIONING
9 25185 HILBERTS TENTH PROBLEM//DIOPHANTINE DEFINITION//BUCHIS PROBLEM
10 11418 CUTTING PLANES//LIFT AND PROJECT//SPLIT CUTS

Go to start page