Randomness and Computation
E17284
"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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Randomness and Computation canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T143790 — 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: Randomness and Computation Context triple: [Shafi Goldwasser, thesisTitle, Randomness and Computation]
-
A.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
-
B.
Strategic Computing Initiative
The Strategic Computing Initiative was a major 1980s U.S. defense research program aimed at advancing artificial intelligence, machine vision, and high-performance computing for military applications.
-
C.
Communication Theory of Secrecy Systems
Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
-
D.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
-
E.
Boltzmann machines
Boltzmann machines are stochastic recurrent neural networks used for learning complex probability distributions, foundational in unsupervised learning and energy-based models.
- 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: Randomness and Computation Target entity description: "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.
-
A.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
-
B.
Strategic Computing Initiative
The Strategic Computing Initiative was a major 1980s U.S. defense research program aimed at advancing artificial intelligence, machine vision, and high-performance computing for military applications.
-
C.
Communication Theory of Secrecy Systems
Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
-
D.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
-
E.
Boltzmann machines
Boltzmann machines are stochastic recurrent neural networks used for learning complex probability distributions, foundational in unsupervised learning and energy-based models.
- F. None of above. chosen
Statements (30)
| Predicate | Object |
|---|---|
| instanceOf |
academic dissertation
ⓘ
doctoral thesis ⓘ |
| academicAdvisor |
Manuel Blum
ⓘ
Silvio Micali ⓘ |
| academicDiscipline | computer science ⓘ |
| author | Shafi Goldwasser ⓘ |
| citedAs |
foundational work in complexity theory
ⓘ
foundational work in cryptography ⓘ |
| contributedTo |
foundations of modern complexity theory
ⓘ
foundations of modern cryptography ⓘ |
| countryOfOrigin |
United States of America
ⓘ
surface form:
United States
|
| field |
computational complexity theory
ⓘ
cryptography ⓘ theoretical computer science ⓘ |
| focusesOn |
role of randomness in efficient computation
ⓘ
security definitions based on probabilistic computation ⓘ use of randomness in algorithm design ⓘ |
| genre | scientific thesis ⓘ |
| hasAuthorDissertation | Shafi Goldwasser doctoral work ⓘ |
| influenced |
design of cryptographic protocols
ⓘ
formalization of zero-knowledge ⓘ study of randomized complexity classes ⓘ theory of probabilistic polynomial-time computation ⓘ |
| institution | Massachusetts Institute of Technology ⓘ |
| language | English ⓘ |
| topic |
complexity classes involving randomness
ⓘ
interactive proofs ⓘ probabilistic algorithms ⓘ randomness in computation ⓘ zero-knowledge proofs ⓘ |
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: Randomness and Computation Description of subject: "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.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.