Matches in DBpedia 2016-04 for { <http://books.google.com/books?vid=ISBN978-0-521-42426-4> ?p ?o }
Showing triples 1 to 47 of
47
with 100 triples per page.
- books?vid=ISBN978-0-521-42426-4 author "Sanjeev Arora and Boaz Barak".
- books?vid=ISBN978-0-521-42426-4 author "Sanjeev Arora, Boaz Barak".
- books?vid=ISBN978-0-521-42426-4 author1Link "Sanjeev Arora".
- books?vid=ISBN978-0-521-42426-4 authorlink1 "Sanjeev Arora".
- books?vid=ISBN978-0-521-42426-4 chapter "Section 19.5".
- books?vid=ISBN978-0-521-42426-4 date "2009".
- books?vid=ISBN978-0-521-42426-4 first1 "Sanjeev".
- books?vid=ISBN978-0-521-42426-4 first2 "Boaz".
- books?vid=ISBN978-0-521-42426-4 isCitedBy AC0.
- books?vid=ISBN978-0-521-42426-4 isCitedBy AC_(complexity).
- books?vid=ISBN978-0-521-42426-4 isCitedBy Arthur–Merlin_protocol.
- books?vid=ISBN978-0-521-42426-4 isCitedBy Computational_complexity_theory.
- books?vid=ISBN978-0-521-42426-4 isCitedBy Configuration_graph.
- books?vid=ISBN978-0-521-42426-4 isCitedBy DSPACE.
- books?vid=ISBN978-0-521-42426-4 isCitedBy Distributed_computing.
- books?vid=ISBN978-0-521-42426-4 isCitedBy Hadamard_code.
- books?vid=ISBN978-0-521-42426-4 isCitedBy L_(complexity).
- books?vid=ISBN978-0-521-42426-4 isCitedBy List_of_complexity_classes.
- books?vid=ISBN978-0-521-42426-4 isCitedBy Locally_decodable_code.
- books?vid=ISBN978-0-521-42426-4 isCitedBy Log-space_reduction.
- books?vid=ISBN978-0-521-42426-4 isCitedBy NC_(complexity).
- books?vid=ISBN978-0-521-42426-4 isCitedBy NEXPTIME.
- books?vid=ISBN978-0-521-42426-4 isCitedBy PSPACE.
- books?vid=ISBN978-0-521-42426-4 isCitedBy Padding_argument.
- books?vid=ISBN978-0-521-42426-4 isCitedBy Savitchs_theorem.
- books?vid=ISBN978-0-521-42426-4 isCitedBy Space_hierarchy_theorem.
- books?vid=ISBN978-0-521-42426-4 isCitedBy Switching_lemma.
- books?vid=ISBN978-0-521-42426-4 isCitedBy Universal_Turing_machine.
- books?vid=ISBN978-0-521-42426-4 isbn "978-0-521-42426-4".
- books?vid=ISBN978-0-521-42426-4 last1 "Arora".
- books?vid=ISBN978-0-521-42426-4 last2 "Barak".
- books?vid=ISBN978-0-521-42426-4 page "57".
- books?vid=ISBN978-0-521-42426-4 pages "117–118, 287".
- books?vid=ISBN978-0-521-42426-4 postscript ".".
- books?vid=ISBN978-0-521-42426-4 publisher Cambridge_University_Press.
- books?vid=ISBN978-0-521-42426-4 publisher "Cambridge University Press".
- books?vid=ISBN978-0-521-42426-4 publisher "Cambridge University Press; 1 edition".
- books?vid=ISBN978-0-521-42426-4 quote "1.9".
- books?vid=ISBN978-0-521-42426-4 ref "harv".
- books?vid=ISBN978-0-521-42426-4 title "Complexity Theory: A Modern Approach".
- books?vid=ISBN978-0-521-42426-4 title "Computational Complexity – A Modern Approach".
- books?vid=ISBN978-0-521-42426-4 title "Computational Complexity: A Modern Approach".
- books?vid=ISBN978-0-521-42426-4 title "Computational complexity, a modern approach".
- books?vid=ISBN978-0-521-42426-4 title "Computational complexity. A modern approach".
- books?vid=ISBN978-0-521-42426-4 url complexity.
- books?vid=ISBN978-0-521-42426-4 year "2009".
- books?vid=ISBN978-0-521-42426-4 zbl "1193.68112".