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

Basic class information
ID Publications Average number
of references		 Avg. shr. active
ref. in WoS
13564 763 19.9 31%


Bar chart of Publication_year

Last years might be incomplete

Classes in level above (level 2)


ID, lev.
above		 Publications Label for level above
1681 6221 LOGIC//JOURNAL OF SYMBOLIC LOGIC//ANNALS OF PURE AND APPLIED LOGIC

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 BOUNDED ARITHMETIC Author keyword 117 79% 10% 75
2 PROOF COMPLEXITY Author keyword 78 65% 10% 74
3 PROPOSITIONAL PROOF COMPLEXITY Author keyword 29 71% 3% 24
4 POLYNOMIAL CALCULUS Author keyword 26 87% 2% 13
5 WEAK PIGEONHOLE PRINCIPLE Author keyword 17 100% 1% 8
6 PIGEONHOLE PRINCIPLE Author keyword 13 67% 2% 12
7 INTERPRETABILITY LOGIC Author keyword 11 78% 1% 7
8 AUTOMATIZABILITY Author keyword 9 83% 1% 5
9 FREGE PROOFS Author keyword 9 83% 1% 5
10 FREGE SYSTEM Author keyword 8 100% 1% 5

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 BOUNDED ARITHMETIC 117 79% 10% 75 Search BOUNDED+ARITHMETIC Search BOUNDED+ARITHMETIC
2 PROOF COMPLEXITY 78 65% 10% 74 Search PROOF+COMPLEXITY Search PROOF+COMPLEXITY
3 PROPOSITIONAL PROOF COMPLEXITY 29 71% 3% 24 Search PROPOSITIONAL+PROOF+COMPLEXITY Search PROPOSITIONAL+PROOF+COMPLEXITY
4 POLYNOMIAL CALCULUS 26 87% 2% 13 Search POLYNOMIAL+CALCULUS Search POLYNOMIAL+CALCULUS
5 WEAK PIGEONHOLE PRINCIPLE 17 100% 1% 8 Search WEAK+PIGEONHOLE+PRINCIPLE Search WEAK+PIGEONHOLE+PRINCIPLE
6 PIGEONHOLE PRINCIPLE 13 67% 2% 12 Search PIGEONHOLE+PRINCIPLE Search PIGEONHOLE+PRINCIPLE
7 INTERPRETABILITY LOGIC 11 78% 1% 7 Search INTERPRETABILITY+LOGIC Search INTERPRETABILITY+LOGIC
8 AUTOMATIZABILITY 9 83% 1% 5 Search AUTOMATIZABILITY Search AUTOMATIZABILITY
9 FREGE PROOFS 9 83% 1% 5 Search FREGE+PROOFS Search FREGE+PROOFS
10 FREGE SYSTEM 8 100% 1% 5 Search FREGE+SYSTEM Search FREGE+SYSTEM

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 PIGEONHOLE PRINCIPLE 48 77% 4% 33
2 WEAK PIGEONHOLE PRINCIPLE 48 77% 4% 33
3 POLYNOMIAL CALCULUS 32 85% 2% 17
4 HARD EXAMPLES 25 51% 5% 35
5 HERBRAND CONSISTENCY 17 100% 1% 8
6 PARAMETER FREE INDUCTION 17 100% 1% 8
7 DEPTH FREGE PROOFS 14 100% 1% 7
8 PROPOSITIONAL PROOF SYSTEMS 14 57% 2% 16
9 CUTTING PLANE PROOFS 12 58% 2% 14
10 TRICKY FORMULAS 11 67% 1% 10

Journals

Reviews


Title Publ. year Cit. Active
references		 % act. ref.
to same field
The complexity of propositional proofs 2007 18 59 88%
Combining satisfiability techniques from Al and OR 2000 6 10 50%
Symmetry in Boolean Satisfiability 2010 0 7 43%
COMPLEXITY PROBLEMS IN COMPUTATIONAL THEORY 1981 4 6 33%

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 ALGEBRA COMPUTAT MATH 2 33% 0.5% 4
2 CIRL 1 27% 0.4% 3
3 FILOSOFIA LOG FILOSOFIA CIENCIA 1 25% 0.4% 3
4 ALGEBRA LOG COMPUTAT 1 50% 0.1% 1
5 ELECT SENSO 1 50% 0.1% 1
6 INTEL CELLULAR COMMUN 1 50% 0.1% 1
7 KGRC 1 50% 0.1% 1
8 LFE THEORET INFORMAT 1 50% 0.1% 1
9 LIENGUATGES SIST INFORMAT 1 50% 0.1% 1
10 SMART COMMUN SYST 1 50% 0.1% 1

Related classes at same level (level 1)


Rank Relatedness score Related classes
1 0.0000180519 RECURSIVE SATURATION//BERRYS PARADOX//MODELS OF PEANO ARITHMETIC
2 0.0000150353 REVERSE MATHEMATICS//APPLICATIVE THEORIES//EXPLICIT MATHEMATICS
3 0.0000130073 LOGIC OF PROOFS//JUSTIFICATION LOGIC//ADMISSIBLE RULES
4 0.0000117251 SATISFIABILITY//MESSAGE PASSING ALGORITHMS//CAVITY AND REPLICA METHOD
5 0.0000098797 LDCSEE//LCSEE//QUANTIFIED BOOLEAN FORMULA
6 0.0000095584 RESOURCE BOUNDED MEASURE//COMPUTATIONAL COMPLEXITY//DISJOINT NP PAIRS
7 0.0000087139 NEGATION LIMITED CIRCUIT//COMMUNICATION COMPLEXITY//MULTIPARTY COMMUNICATION COMPLEXITY
8 0.0000065521 HILBERTS TENTH PROBLEM//BUCHIS PROBLEM//DIOPHANTINE DEFINITION
9 0.0000063188 CUTTING PLANES//LIFT AND PROJECT//MIXED INTEGER ROUNDING
10 0.0000056650 ABSTRACT INTERPRETATION//PREDICATE ABSTRACTION//SATISFIABILITY MODULO THEORIES