Statements (60)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:Computer_Scientist
|
| gptkbp:academic_advisor |
gptkb:Shafi_Goldwasser
gptkb:Silvio_Micali |
| gptkbp:alma_mater |
gptkb:University_of_California,_Berkeley
|
| gptkbp:author |
gptkb:Daniel_A._Spielman
gptkb:M._A._(Marty)_Kearns Introduction to the Theory of Computation |
| gptkbp:award |
gptkb:Knuth_Prize
gptkb:IEEE_Fellow gptkb:Godel_Prize ACM Fellow |
| gptkbp:birth_date |
1950-01-01
|
| gptkbp:contribution |
gptkb:crypt
gptkb:NP-Completeness gptkb:Quantum_Computing gptkb:Algorithmic_Information_Theory gptkb:Algorithmic_Game_Theory Computational Models Data Structures Discrete Mathematics Formal Languages Algorithm Design Circuit Complexity Computational Complexity Mathematical Logic Decidability Graph Theory Randomized Algorithms Computational Geometry Theory of Computation Approximation Algorithms Complexity Classes Computational Learning Theory Interactive Proofs Computational Aspects of Game Theory Computational Aspects of Algebra Computational Aspects of Combinatorics Computational Aspects of Cryptography Computational Aspects of Geometry Computational Aspects of Information Theory Computational Aspects of Network Theory Computational Aspects of Probability Computational Aspects of Quantum Mechanics Computational Aspects of Topology Computational Models of Learning Pseudorandomness |
| gptkbp:field |
Theoretical Computer Science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Michael Sipser
|
| gptkbp:influenced_by |
gptkb:Stephen_Cook
gptkb:John_Hopcroft gptkb:Michael_Rabin |
| gptkbp:known_for |
Textbook on Introduction to the Theory of Computation
|
| gptkbp:nationality |
gptkb:American
|
| gptkbp:occupation |
gptkb:Professor
|
| gptkbp:research_interest |
gptkb:Mathematics
Automata Theory Computational Theory |
| gptkbp:work_location |
gptkb:Massachusetts_Institute_of_Technology
|
| gptkbp:bfsParent |
gptkb:Scott_Aaronson
|
| gptkbp:bfsLayer |
4
|