Introduction to Property Testing
E122537
Introduction to Property Testing is a foundational textbook that systematically develops the theory, techniques, and applications of property testing in theoretical computer science.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Introduction to Property Testing canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1013316 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Introduction to Property Testing Context triple: [Oded Goldreich, authorOf, Introduction to Property Testing]
-
A.
Interactive Proofs and the Hardness of Approximating Cliques
"Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
-
B.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
-
C.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
-
D.
The Knowledge Complexity of Interactive Proof Systems
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
-
E.
PCP theorem
The PCP theorem is a fundamental result in computational complexity theory stating that every problem in NP has probabilistically checkable proofs that can be verified by examining only a constant number of bits, with major implications for the hardness of approximation.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Introduction to Property Testing Target entity description: Introduction to Property Testing is a foundational textbook that systematically develops the theory, techniques, and applications of property testing in theoretical computer science.
-
A.
Interactive Proofs and the Hardness of Approximating Cliques
"Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
-
B.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
-
C.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
-
D.
The Knowledge Complexity of Interactive Proof Systems
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
-
E.
PCP theorem
The PCP theorem is a fundamental result in computational complexity theory stating that every problem in NP has probabilistically checkable proofs that can be verified by examining only a constant number of bits, with major implications for the hardness of approximation.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
computer science book
ⓘ
non-fiction book ⓘ textbook ⓘ |
| aim |
to present techniques for designing property testers
ⓘ
to survey applications of property testing in computer science ⓘ to systematically develop the theory of property testing ⓘ |
| describes |
adaptive and non-adaptive testers
ⓘ
applications of property testing in algorithm design ⓘ canonical testers for graph properties ⓘ connections between property testing and PCPs ⓘ connections between property testing and learning theory ⓘ distance measures between objects in property testing ⓘ general framework for property testing algorithms ⓘ lower bound techniques in property testing ⓘ one-sided and two-sided error testers ⓘ query-efficient algorithms for testing properties ⓘ tolerant testing ⓘ |
| educationalUse |
course textbook
ⓘ
self-study resource ⓘ |
| field | theoretical computer science ⓘ |
| focus |
algorithmic aspects of property testing
ⓘ
complexity-theoretic aspects of property testing ⓘ rigorous mathematical treatment of property testing ⓘ |
| genre | academic textbook ⓘ |
| intendedAudience |
advanced undergraduates
ⓘ
graduate students ⓘ researchers in theoretical computer science ⓘ |
| language | English ⓘ |
| mainSubject | property testing ⓘ |
| structure | organized as a foundational, theory-oriented text ⓘ |
| topic |
Fourier analysis of Boolean functions
ⓘ
approximation algorithms ⓘ communication complexity ⓘ hardness of approximation ⓘ learning theory connections ⓘ probabilistic method ⓘ probabilistically checkable proofs ⓘ property testing of distributions ⓘ property testing of functions ⓘ property testing of graphs ⓘ query complexity ⓘ randomized algorithms ⓘ sublinear-time algorithms ⓘ |
| use |
basis for graduate-level courses on property testing
ⓘ
reference for researchers in property testing ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Introduction to Property Testing Description of subject: Introduction to Property Testing is a foundational textbook that systematically develops the theory, techniques, and applications of property testing in theoretical computer science.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.