Matches in DBpedia 2016-04 for { <http://books.google.com/books?vid=ISBN0-201-53082-1> ?p ?o }
Showing triples 1 to 77 of
77
with 100 triples per page.
- books?vid=ISBN0-201-53082-1 at "Chapter 16: Logarithmic space, pp. 395–408".
- books?vid=ISBN0-201-53082-1 author Christos_Papadimitriou.
- books?vid=ISBN0-201-53082-1 author "Christos Papadimitriou".
- books?vid=ISBN0-201-53082-1 authorLink "Christos Papadimitriou".
- books?vid=ISBN0-201-53082-1 authorlink "Christos H. Papadimitriou".
- books?vid=ISBN0-201-53082-1 authorlink "Christos Papadimitriou".
- books?vid=ISBN0-201-53082-1 chapter "Chapter 16: Logarithmic Space".
- books?vid=ISBN0-201-53082-1 chapter "Chapter 8: Reductions And Completeness".
- books?vid=ISBN0-201-53082-1 chapter "Section 10.2: Primality".
- books?vid=ISBN0-201-53082-1 chapter "Section 12.1: One-way functions".
- books?vid=ISBN0-201-53082-1 chapter "Section 15.3: The class NC".
- books?vid=ISBN0-201-53082-1 contribution "Section 7.3: The Reachability Method".
- books?vid=ISBN0-201-53082-1 date "1993".
- books?vid=ISBN0-201-53082-1 edition "1.0".
- books?vid=ISBN0-201-53082-1 first "C.".
- books?vid=ISBN0-201-53082-1 first "Christos H.".
- books?vid=ISBN0-201-53082-1 first "Christos".
- books?vid=ISBN0-201-53082-1 first1 "Christos".
- books?vid=ISBN0-201-53082-1 isCitedBy 2-satisfiability.
- books?vid=ISBN0-201-53082-1 isCitedBy Alternating_Turing_machine.
- books?vid=ISBN0-201-53082-1 isCitedBy BPP_(complexity).
- books?vid=ISBN0-201-53082-1 isCitedBy Computability.
- books?vid=ISBN0-201-53082-1 isCitedBy Computational_complexity_theory.
- books?vid=ISBN0-201-53082-1 isCitedBy DTIME.
- books?vid=ISBN0-201-53082-1 isCitedBy Distributed_computing.
- books?vid=ISBN0-201-53082-1 isCitedBy EXPTIME.
- books?vid=ISBN0-201-53082-1 isCitedBy Finite-state_machine.
- books?vid=ISBN0-201-53082-1 isCitedBy Interactive_proof_system.
- books?vid=ISBN0-201-53082-1 isCitedBy L_(complexity).
- books?vid=ISBN0-201-53082-1 isCitedBy Leaf_language.
- books?vid=ISBN0-201-53082-1 isCitedBy Log-space_reduction.
- books?vid=ISBN0-201-53082-1 isCitedBy Multitape_Turing_machine.
- books?vid=ISBN0-201-53082-1 isCitedBy NC_(complexity).
- books?vid=ISBN0-201-53082-1 isCitedBy NL_(complexity).
- books?vid=ISBN0-201-53082-1 isCitedBy NP-completeness.
- books?vid=ISBN0-201-53082-1 isCitedBy Negligible_function.
- books?vid=ISBN0-201-53082-1 isCitedBy Nick_Pippenger.
- books?vid=ISBN0-201-53082-1 isCitedBy Non-deterministic_Turing_machine.
- books?vid=ISBN0-201-53082-1 isCitedBy One-way_function.
- books?vid=ISBN0-201-53082-1 isCitedBy PSPACE.
- books?vid=ISBN0-201-53082-1 isCitedBy P_(complexity).
- books?vid=ISBN0-201-53082-1 isCitedBy P_versus_NP_problem.
- books?vid=ISBN0-201-53082-1 isCitedBy Primality_test.
- books?vid=ISBN0-201-53082-1 isCitedBy Randomized_algorithm.
- books?vid=ISBN0-201-53082-1 isCitedBy Savitchs_theorem.
- books?vid=ISBN0-201-53082-1 isCitedBy Space_hierarchy_theorem.
- books?vid=ISBN0-201-53082-1 isCitedBy Time_complexity.
- books?vid=ISBN0-201-53082-1 isCitedBy Time_hierarchy_theorem.
- books?vid=ISBN0-201-53082-1 isCitedBy Turing_machine.
- books?vid=ISBN0-201-53082-1 isCitedBy Turing_machine_equivalents.
- books?vid=ISBN0-201-53082-1 isbn "0-201-53082-1".
- books?vid=ISBN0-201-53082-1 last "Papadimitriou".
- books?vid=ISBN0-201-53082-1 last1 "Papadimitriou".
- books?vid=ISBN0-201-53082-1 location "Boston".
- books?vid=ISBN0-201-53082-1 location "Reading, Mass.".
- books?vid=ISBN0-201-53082-1 location "Reading, Massachusetts".
- books?vid=ISBN0-201-53082-1 nopp "true".
- books?vid=ISBN0-201-53082-1 page "53".
- books?vid=ISBN0-201-53082-1 pages "149–150".
- books?vid=ISBN0-201-53082-1 pages "159–180".
- books?vid=ISBN0-201-53082-1 pages "222–227".
- books?vid=ISBN0-201-53082-1 pages "279–298".
- books?vid=ISBN0-201-53082-1 pages "375–381".
- books?vid=ISBN0-201-53082-1 pages "375–381".
- books?vid=ISBN0-201-53082-1 pages "504–505".
- books?vid=ISBN0-201-53082-1 pages "Chapter 9 , pp. 181–218".
- books?vid=ISBN0-201-53082-1 pages "chapter 4.2".
- books?vid=ISBN0-201-53082-1 publisher Addison–Wesley.
- books?vid=ISBN0-201-53082-1 publisher "Addison Wesley".
- books?vid=ISBN0-201-53082-1 publisher "Addison-Wesley".
- books?vid=ISBN0-201-53082-1 publisher "Addison–Wesley".
- books?vid=ISBN0-201-53082-1 ref "harv".
- books?vid=ISBN0-201-53082-1 title "Computational Complexity".
- books?vid=ISBN0-201-53082-1 title "Computational complexity".
- books?vid=ISBN0-201-53082-1 year "1993".
- books?vid=ISBN0-201-53082-1 year "1994".
- books?vid=ISBN0-201-53082-1 zbl "0833.68049".