Class information for:
Level 1: PROPERTY TESTING//PROBABILISTICALLY CHECKABLE PROOFS//SUBLINEAR ALGORITHMS

Basic class information
ID Publications Average number
of references		 Avg. shr. active
ref. in WoS
18683 474 24.2 40%


Bar chart of Publication_year

Last years might be incomplete

Classes in level above (level 2)


ID, lev.
above		 Publications Label for level above
774 11629 COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS//COMPUTATIONAL GEOMETRY//APPROXIMATION ALGORITHMS

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 PROPERTY TESTING Author keyword 92 59% 22% 102
2 PROBABILISTICALLY CHECKABLE PROOFS Author keyword 17 57% 4% 20
3 SUBLINEAR ALGORITHMS Author keyword 10 52% 3% 14
4 LOCALLY TESTABLE CODES Author keyword 8 52% 2% 11
5 SUBLINEAR TIME ALGORITHMS Author keyword 7 46% 2% 11
6 APPROXIMATION RESISTANCE Author keyword 6 80% 1% 4
7 PROBABILISTIC PROOF SYSTEMS Author keyword 6 71% 1% 5
8 PROBABILISTICALLY CHECKABLE PROOFS PCPS Author keyword 6 100% 1% 4
9 BOUNDED DEGREE MODEL Author keyword 4 75% 1% 3
10 HARDNESS OF APPROXIMATIONS Author keyword 4 75% 1% 3

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 PROPERTY TESTING 92 59% 22% 102 Search PROPERTY+TESTING Search PROPERTY+TESTING
2 PROBABILISTICALLY CHECKABLE PROOFS 17 57% 4% 20 Search PROBABILISTICALLY+CHECKABLE+PROOFS Search PROBABILISTICALLY+CHECKABLE+PROOFS
3 SUBLINEAR ALGORITHMS 10 52% 3% 14 Search SUBLINEAR+ALGORITHMS Search SUBLINEAR+ALGORITHMS
4 LOCALLY TESTABLE CODES 8 52% 2% 11 Search LOCALLY+TESTABLE+CODES Search LOCALLY+TESTABLE+CODES
5 SUBLINEAR TIME ALGORITHMS 7 46% 2% 11 Search SUBLINEAR+TIME+ALGORITHMS Search SUBLINEAR+TIME+ALGORITHMS
6 APPROXIMATION RESISTANCE 6 80% 1% 4 Search APPROXIMATION+RESISTANCE Search APPROXIMATION+RESISTANCE
7 PROBABILISTIC PROOF SYSTEMS 6 71% 1% 5 Search PROBABILISTIC+PROOF+SYSTEMS Search PROBABILISTIC+PROOF+SYSTEMS
8 PROBABILISTICALLY CHECKABLE PROOFS PCPS 6 100% 1% 4 Search PROBABILISTICALLY+CHECKABLE+PROOFS+PCPS Search PROBABILISTICALLY+CHECKABLE+PROOFS+PCPS
9 BOUNDED DEGREE MODEL 4 75% 1% 3 Search BOUNDED+DEGREE+MODEL Search BOUNDED+DEGREE+MODEL
10 HARDNESS OF APPROXIMATIONS 4 75% 1% 3 Search HARDNESS+OF+APPROXIMATIONS Search HARDNESS+OF+APPROXIMATIONS

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 BIPARTITENESS 13 69% 2% 11
2 WIDTH BRANCHING PROGRAMS 11 100% 1% 6
3 PCPS 8 45% 3% 13
4 INTERACTIVE PROOF SYSTEMS 6 32% 3% 15
5 IP PSPACE 4 50% 1% 6
6 BOUNDED DEGREE GRAPHS 4 38% 2% 8
7 GRAPH PROPERTIES 4 46% 1% 6
8 LOW DEGREE POLYNOMIALS 3 100% 1% 3
9 JUNTAS 3 40% 1% 6
10 TESTING MONOTONICITY 3 45% 1% 5

Journals

Reviews


Title Publ. year Cit. Active
references		 % act. ref.
to same field
Proof verification and the hardness of approximation problems 1998 446 33 33%
Verifying Computations without Reexecuting Them 2015 0 10 60%
Probabilistically Checkable Proofs 2009 2 16 50%
Quantum Money 2012 0 7 14%
Lectures on proof verification and approximation algorithms - Introduction 1998 0 30 13%

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 EE SYST 2 15% 3.0% 14
2 COMPUTAT INTRACTABIL 2 50% 0.6% 3
3 SACKLER MATH 0 11% 0.6% 3
4 CSAI 0 25% 0.2% 1
5 INFORMAT 17 0 25% 0.2% 1
6 KRYPTOG SICHERHEIT 0 25% 0.2% 1
7 DISCRETE MATH ITS PLICAT DIM 0 12% 0.4% 2
8 DISCRETE MATH PLICAT 0 20% 0.2% 1
9 RCQI 0 20% 0.2% 1
10 DISCRETE MATH PLICAT DIM 0 14% 0.2% 1

Related classes at same level (level 1)


Rank Relatedness score Related classes
1 0.0000288117 VERTEX COVER//DIFFERENTIAL RATIO//PRIORITY ALGORITHMS
2 0.0000138429 TURAN DENSITY//FORBIDDEN CONFIGURATIONS//SZEMEREDIS REGULARITY LEMMA
3 0.0000120971 PATH COLORING//K SPLITTABLE FLOW//PARTITIONED OPTICAL PASSIVE STARS NETWORK
4 0.0000111191 NEGATION LIMITED CIRCUIT//COMMUNICATION COMPLEXITY//MULTIPARTY COMMUNICATION COMPLEXITY
5 0.0000108393 RESOURCE BOUNDED MEASURE//COMPUTATIONAL COMPLEXITY//DISJOINT NP PAIRS
6 0.0000107589 OBLIVIOUS TRANSFER//PRIVATE INFORMATION RETRIEVAL//LOCALLY DECODABLE CODES
7 0.0000092425 BEURLING GENERALIZED PRIMES//BEURLING GENERALIZED NUMBERS//CHEBYSHEV PRIME BOUNDS
8 0.0000091257 K MEDIAN//BROADCAST DOMINATION//FACILITY LOCATION PROBLEM
9 0.0000089562 DYNAMIC GRAPH ALGORITHMS//REPLACEMENT PATHS//SHORTEST PATHS
10 0.0000086154 GRAPH COVERING//EXTRACTORS//IHARA ZETA FUNCTION