LEADER 04065nam 2200625 a 450 001 9910460278803321 005 20200520144314.0 010 $a1-282-95218-8 010 $a9786612952180 010 $a90-04-18363-9 024 7 $a10.1163/ej.9789004181151.i-338 035 $a(CKB)2670000000067262 035 $a(EBL)635115 035 $a(OCoLC)695982166 035 $a(SSID)ssj0000437319 035 $a(PQKBManifestationID)11279831 035 $a(PQKBTitleCode)TC0000437319 035 $a(PQKBWorkID)10432393 035 $a(PQKB)10729330 035 $a(MiAaPQ)EBC635115 035 $a(OCoLC)463307585$z(OCoLC)457129777 035 $a(nllekb)BRILL9789004183636 035 $a(PPN)170741818 035 $a(Au-PeEL)EBL635115 035 $a(CaPaEBR)ebr10439297 035 $a(CaONFJC)MIL295218 035 $a(EXLCZ)992670000000067262 100 $a20091029d2010 uy 0 101 0 $aeng 135 $aurun####uuuua 181 $ctxt 182 $cc 183 $acr 200 15$a"The great ocean of knowledge"$b[electronic resource] $ethe influence of travel literature on the work of John Locke /$fby Ann Talbot 210 $aLeiden ;$aBoston $cBrill$d2010 215 $a1 online resource (348 p.) 225 1 $aBrill's studies in intellectual history,$x0920-8607 ;$vv. 184 300 $aBased on the author's thesis--University of Bolton. 311 $a90-04-18115-6 320 $aIncludes bibliographical references and index. 327 $tPreliminary Material /$rA. Talbot --$tChapter One. Introduction /$rA. Talbot --$tChapter Two. \'Fit For Our Imitation\': Locke, Sagard And The Huron /$rA. Talbot --$tChapter Three. Locke And The Lapland Witches /$rA. Talbot --$tChapter Four. Merchants Of Light: Locke And Utopia /$rA. Talbot --$tChapter Five. Cannibalism And Absolutism /$rA. Talbot --$tChapter Six. From \'Stinging Swarms Of Miseries\' To A State Of Equality And Freedom /$rA. Talbot --$tChapter Seven. \'Beyond The Smoke Of Their Own Chimneys\': Travel Literature And Innate Ideas /$rA. Talbot --$tChapter Eight. Travel Literature In The Essay Concerning Human Understanding /$rA. Talbot --$tChapter Nine. After The Essay: Travel Literature In The Stillingfleet Controversy /$rA. Talbot --$tChapter Ten. \'A Great And Civilized People\': Locke, China And Materialism /$rA. Talbot --$tChapter Eleven. \'And Knowledge Shall Be Increased\': Bacon, The Royal Society And Travel Literature /$rA. Talbot --$tChapter Twelve. Making The Eye-Witness Authoritative /$rA. Talbot --$tChapter Thirteen. The Enchanted Glass: Early Modern Ethnography /$rA. Talbot --$tChapter Fourteen. Locke And Post colonialism /$rA. Talbot --$tChapter Fifteen. Conclusion /$rA. Talbot --$tAppendix 1 /$rA. Talbot --$tAppendix 2 /$rA. Talbot --$tBibliography /$rA. Talbot --$tIndex /$rA. Talbot. 330 $aThe philosopher John Locke (1632-1704) owned one of the most extensive collections of travel literature held in any private scholarly library of his day. It is an interest which seems very much at odds with Locke's reputation as an empirical philosopher because travellers' reports have acquired a reputation for unreliability. This book sets Locke's use of travel literature within the context of the natural historical methods of investigation associated with Francis Bacon and the Royal Society. It examines the notes he made in his commonplace books to demonstrate that Locke was developing a form of comparative social anthropology and had a sympathetic attitude towards Native Americans despite his role as a colonial administrator. 410 0$aBrill's studies in intellectual history ;$vv. 184. 606 $aTravelers' writings, European$xHistory and criticism 608 $aElectronic books. 615 0$aTravelers' writings, European$xHistory and criticism. 676 $a192 700 $aTalbot$b Ann$0982999 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910460278803321 996 $a"The great ocean of knowledge"$92243466 997 $aUNINA LEADER 05391nam 2200673 450 001 9910812152703321 005 20200520144314.0 010 $a1-118-59509-2 010 $a1-118-59303-0 035 $a(CKB)3710000000117845 035 $a(EBL)1695068 035 $a(SSID)ssj0001225536 035 $a(PQKBManifestationID)11749700 035 $a(PQKBTitleCode)TC0001225536 035 $a(PQKBWorkID)11269943 035 $a(PQKB)11577170 035 $a(OCoLC)880827316 035 $a(MiAaPQ)EBC1695068 035 $a(Au-PeEL)EBL1695068 035 $a(CaPaEBR)ebr10876079 035 $a(CaONFJC)MIL613400 035 $a(PPN)191455474 035 $a(EXLCZ)993710000000117845 100 $a20140615h20142014 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aTheory of computational complexity /$fDing-Zhu Du, Ker-I Ko 205 $aSecond edition. 210 1$aHoboken, New Jersey :$cWiley,$d2014. 210 4$d©2014 215 $a1 online resource (514 p.) 225 1 $aWiley Series in Discrete Mathematics and Optimization 300 $aDescription based upon print version of record. 311 $a1-118-30608-2 320 $aIncludes bibliographical references and index. 327 $aCover; Title Page; Contents; Preface; Notes on the Second Edition; Part I Uniform Complexity; Chapter 1 Models of Computation and Complexity Classes; 1.1 Strings, Coding, and Boolean Functions; 1.2 Deterministic Turing Machines; 1.3 Nondeterministic Turing Machines; 1.4 Complexity Classes; 1.5 Universal Turing Machine; 1.6 Diagonalization; 1.7 Simulation; Exercises; Historical Notes; Chapter 2 NP-Completeness; 2.1 NP; 2.2 Cook's Theorem; 2.3 More NP-Complete Problems; 2.4 Polynomial-Time Turing Reducibility; 2.5 NP-Complete Optimization Problems; Exercises; Historical Notes 327 $aChapter 3 The Polynomial-Time Hierarchy and Polynomial Space3.1 Nondeterministic Oracle Turing Machines; 3.2 Polynomial-Time Hierarchy; 3.3 Complete Problems in PH; 3.4 Alternating Turing Machines; 3.5 PSPACE-Complete Problems; 3.6 EXP-Complete Problems; Exercises; Historical Notes; Chapter 4 Structure of NP; 4.1 Incomplete Problems in NP; 4.2 One-Way Functions and Cryptography; 4.3 Relativization; 4.4 Unrelativizable Proof Techniques; 4.5 Independence Results; 4.6 Positive Relativization; 4.7 Random Oracles; 4.8 Structure of Relativized NP; Exercises; Historical Notes 327 $aPart II Nonuniform ComplexityChapter 5 Decision Trees; 5.1 Graphs and Decision Trees; 5.2 Examples; 5.3 Algebraic Criterion; 5.4 Monotone Graph Properties; 5.5 Topological Criterion; 5.6 Applications of the Fixed Point Theorems; 5.7 Applications of Permutation Groups; 5.8 Randomized Decision Trees; 5.9 Branching Programs; Exercises; Historical Notes; Chapter 6 Circuit Complexity; 6.1 Boolean Circuits; 6.2 Polynomial-Size Circuits; 6.3 Monotone Circuits; 6.4 Circuits with Modulo Gates; 6.5 NC; 6.6 Parity Function; 6.7 P-Completeness; 6.8 Random Circuits and RNC; Exercises; Historical Notes 327 $aChapter 7 Polynomial-Time Isomorphism7.1 Polynomial-Time Isomorphism; 7.2 Paddability; 7.3 Density of NP-Complete Sets; 7.4 Density of EXP-Complete Sets; 7.5 One-Way Functions and Isomorphism in EXP; 7.6 Density of P-Complete Sets; Exercises; Historical Notes; Part III Probabilistic Complexity; Chapter 8 Probabilistic Machines and Complexity Classes; 8.1 Randomized Algorithms; 8.2 Probabilistic Turing Machines; 8.3 Time Complexity of Probabilistic Turing Machines; 8.4 Probabilistic Machines with Bounded Errors; 8.5 BPP and P; 8.6 BPP and NP; 8.7 BPP and the Polynomial-Time Hierarchy 327 $a8.8 Relativized Probabilistic Complexity ClassesExercises; Historical Notes; Chapter 9 Complexity of Counting; 9.1 Counting Class #P; 9.2 #P-Complete Problems; 9.3 oplus P and the Polynomial-Time Hierarchy; 9.4 #P and the Polynomial-Time Hierarchy; 9.5 Circuit Complexity and Relativized oplus P and #P; 9.6 Relativized Polynomial-Time Hierarchy; Exercises; Historical Notes; Chapter 10 Interactive Proof Systems; 10.1 Examples and Definitions; 10.2 Arthur-Merlin Proof Systems; 10.3 AM Hierarchy Versus Polynomial-Time Hierarchy; 10.4 IP Versus AM; 10.5 IP Versus PSPACE; Exercises 327 $aHistorical Notes 330 $aPraise for the First Edition ""...complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity."" -Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers' feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of 410 0$aWiley series in discrete mathematics and optimization. 606 $aComputational complexity 615 0$aComputational complexity. 676 $a511.3/52 700 $aDu$b Dingzhu$061540 702 $aKo$b Ker-I 712 02$aWiley Online Library (Servicio en línea) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910812152703321 996 $aTheory of computational complexity$93951426 997 $aUNINA