Matches in DBpedia 2015-10 for { <http://www.cs.princeton.edu/theory/complexity/> ?p ?o }
Showing triples 1 to 24 of
24
with 100 triples per page.
- complexity authorlink1 "Sanjeev Arora".
- complexity date "2009".
- complexity first1 "Sanjeev".
- complexity first2 "Boaz".
- complexity isCitedBy Arthur–Merlin_protocol.
- complexity isCitedBy Computational_complexity_theory.
- complexity isCitedBy Hadamard_code.
- complexity isCitedBy NEXPTIME.
- complexity isCitedBy Padding_argument.
- complexity isCitedBy Switching_lemma.
- complexity isCitedBy Universal_Turing_machine.
- complexity isbn "978-0-521-42426-4".
- complexity last1 "Arora".
- complexity last2 "Barak".
- complexity page "57".
- complexity publisher Cambridge_University_Press.
- complexity publisher "Cambridge University Press".
- complexity quote "1.9".
- complexity ref "harv".
- complexity title "Complexity Theory: A Modern Approach".
- complexity title "Computational Complexity: A Modern Approach".
- complexity url complexity.
- complexity year "2009".
- complexity zbl "1193.68112".