. . "QA76.6 .G35"@en . . . . "\u300AComputers and Intractability: A Guide to the Theory of NP-Completeness\u300B\uB294 NP-\uC644\uC804 \uBB38\uC81C\uB97C \uCC98\uC74C \uB2E4\uB8EC \uC804\uC0B0\uD559\uC758 \uACE0\uC804\uC774\uB2E4. \uC640 \uB370\uC774\uBE44\uB4DC S. \uC874\uC2A8\uC774 \uD568\uAED8 \uC9C0\uC740 \uCC45\uC73C\uB85C 1979\uB144\uC5D0 \uCD9C\uD310\uB418\uC5C8\uB2E4. \uC774 \uCC45\uC740 \uC218\uB9CE\uC740 \uB17C\uBB38\uC5D0 \uC790\uC8FC \uC778\uC6A9\uB418\uB294\uB370, \uC8FC\uB85C \uC5B4\uB5A4 \uBB38\uC81C\uAC00 NP-\uC644\uC804\uC784\uC744 \uBCF4\uC774\uB294 \uC6D0 \uCD9C\uCC98\uB85C\uC11C \uC778\uC6A9\uB41C\uB2E4. \uBE44\uB85D PCP \uB4F1 \uCD5C\uADFC\uC5D0 \uB098\uC628 \uC8FC\uC81C\uB97C \uB2E4\uB8E8\uC9C0 \uC54A\uB294 \uB4F1 \uB2E4\uC18C \uC624\uB798\uB418\uC5C8\uB2E4\uB294 \uB2E8\uC810\uC740 \uC788\uC73C\uB098, \uC804\uC0B0\uD559\uC758 \uACE0\uC804\uC73C\uB85C\uC11C \uAC00\uCE58\uAC00 \uC788\uB294 \uCC45\uC73C\uB85C 2000\uB144\uB300 \uB4E4\uC5B4\uC11C\uB3C4 \uACC4\uC18D \uCD9C\uD310\uB418\uACE0 \uC788\uB2E4. \uC774 \uCC45\uC758 \uBD80\uB85D\uC5D0\uB294 \uB2F9\uC2DC \uC54C\uB824\uC84C\uB358 \uC8FC\uC694 NP-\uC644\uC804 \uBB38\uC81C(PSPACE-\uC644\uC804\uC774\uAC70\uB098 \uB354 \uC5B4\uB824\uC6B4 \uBB38\uC81C\uB3C4 \uC788\uB2E4) \uC218\uBC31 \uAC1C\uC758 \uBAA9\uB85D\uC774 \uD3EC\uD568\uB418\uC5B4 \uC788\uB2E4. \uC774 \uBAA9\uB85D\uC740 \uC544\uC8FC \uC720\uBA85\uD558\uC5EC \uC804\uC0B0\uD559\uC790\uB4E4\uC774 \uAC00\uB054 \uCC38\uACE0\uD558\uAE30\uB3C4 \uD558\uACE0, \uC774\uD6C4 \uBCF4\uCDA9\uB41C NP-\uC644\uC804 \uBB38\uC81C\uB4E4\uC758 \uBAA9\uB85D\uB3C4 \uC8FC\uB85C \uC774 \uBAA9\uB85D\uC758 \uD615\uC2DD\uC744 \uB530\uB974\uACE0 \uC788\uB2E4. 2006\uB144 9\uC6D4 \uC870\uC0AC\uC5D0 \uB530\uB974\uBA74 CiteSeer\uC5D0\uC11C \uC774 \uCC45\uC774 \uC804\uC0B0\uD559 \uB17C\uBB38 \uC778\uC6A9 \uD69F\uC218 1\uC704\uB97C \uAE30\uB85D\uD588\uB2E4."@ko . . . "Print"@en . . . . . "Computers and Intractability: A Guide to the Theory of NP-Completeness"@en . "338"^^ . "Computers and Intractability"@en . . "Computers and Intractability: A Guide to the Theory of NP-Completeness"@es . "519.4" . . . . . . "\u300AComputers and Intractability: A Guide to the Theory of NP-Completeness\u300B\uB294 NP-\uC644\uC804 \uBB38\uC81C\uB97C \uCC98\uC74C \uB2E4\uB8EC \uC804\uC0B0\uD559\uC758 \uACE0\uC804\uC774\uB2E4. \uC640 \uB370\uC774\uBE44\uB4DC S. \uC874\uC2A8\uC774 \uD568\uAED8 \uC9C0\uC740 \uCC45\uC73C\uB85C 1979\uB144\uC5D0 \uCD9C\uD310\uB418\uC5C8\uB2E4. \uC774 \uCC45\uC740 \uC218\uB9CE\uC740 \uB17C\uBB38\uC5D0 \uC790\uC8FC \uC778\uC6A9\uB418\uB294\uB370, \uC8FC\uB85C \uC5B4\uB5A4 \uBB38\uC81C\uAC00 NP-\uC644\uC804\uC784\uC744 \uBCF4\uC774\uB294 \uC6D0 \uCD9C\uCC98\uB85C\uC11C \uC778\uC6A9\uB41C\uB2E4. \uBE44\uB85D PCP \uB4F1 \uCD5C\uADFC\uC5D0 \uB098\uC628 \uC8FC\uC81C\uB97C \uB2E4\uB8E8\uC9C0 \uC54A\uB294 \uB4F1 \uB2E4\uC18C \uC624\uB798\uB418\uC5C8\uB2E4\uB294 \uB2E8\uC810\uC740 \uC788\uC73C\uB098, \uC804\uC0B0\uD559\uC758 \uACE0\uC804\uC73C\uB85C\uC11C \uAC00\uCE58\uAC00 \uC788\uB294 \uCC45\uC73C\uB85C 2000\uB144\uB300 \uB4E4\uC5B4\uC11C\uB3C4 \uACC4\uC18D \uCD9C\uD310\uB418\uACE0 \uC788\uB2E4. \uC774 \uCC45\uC758 \uBD80\uB85D\uC5D0\uB294 \uB2F9\uC2DC \uC54C\uB824\uC84C\uB358 \uC8FC\uC694 NP-\uC644\uC804 \uBB38\uC81C(PSPACE-\uC644\uC804\uC774\uAC70\uB098 \uB354 \uC5B4\uB824\uC6B4 \uBB38\uC81C\uB3C4 \uC788\uB2E4) \uC218\uBC31 \uAC1C\uC758 \uBAA9\uB85D\uC774 \uD3EC\uD568\uB418\uC5B4 \uC788\uB2E4. \uC774 \uBAA9\uB85D\uC740 \uC544\uC8FC \uC720\uBA85\uD558\uC5EC \uC804\uC0B0\uD559\uC790\uB4E4\uC774 \uAC00\uB054 \uCC38\uACE0\uD558\uAE30\uB3C4 \uD558\uACE0, \uC774\uD6C4 \uBCF4\uCDA9\uB41C NP-\uC644\uC804 \uBB38\uC81C\uB4E4\uC758 \uBAA9\uB85D\uB3C4 \uC8FC\uB85C \uC774 \uBAA9\uB85D\uC758 \uD615\uC2DD\uC744 \uB530\uB974\uACE0 \uC788\uB2E4. 2006\uB144 9\uC6D4 \uC870\uC0AC\uC5D0 \uB530\uB974\uBA74 CiteSeer\uC5D0\uC11C \uC774 \uCC45\uC774 \uC804\uC0B0\uD559 \uB17C\uBB38 \uC778\uC6A9 \uD69F\uC218 1\uC704\uB97C \uAE30\uB85D\uD588\uB2E4."@ko . . "A Series of Books in the Mathematical Sciences"@en . "1124288323"^^ . "0"^^ . "Computers and Intractability: A Guide to the Theory of NP-Completeness"@en . . . . "English"@en . . . . . . "En ciencias de la computaci\u00F3n, m\u00E1s espec\u00EDficamente en el \u00E1rea de complejidad computacional, Computers and Intractability: A Guide to the Theory of NP-Completeness es un influyente libro de texto escrito por Michael Garey y David S. Johnson."@es . "247570676"^^ . "United States"@en . . "Michael R. Garey and David S. Johnson"@en . "En ciencias de la computaci\u00F3n, m\u00E1s espec\u00EDficamente en el \u00E1rea de complejidad computacional, Computers and Intractability: A Guide to the Theory of NP-Completeness es un influyente libro de texto escrito por Michael Garey y David S. Johnson. Fue el primer libro en tratar formalmente la NP-completitud y la intratabilidad.\u200B El libro contiene un ap\u00E9ndice que provee un exhaustivo compendio de problemas de NP-completitud, el cual ha sido actualizado en las reimpresiones del libro. Actualmente se encuentra desactualizado en algunos aspectos, como el desarrollo del reciente , tema que no cubre. No obstante, se sigue imprimiendo y es considerado un cl\u00E1sico: en un estudio de 2006, el motor de b\u00FAsqueda CiteSeer list\u00F3 este libro como el m\u00E1s citado en la literatura de ciencias de la computaci\u00F3n.\u200B"@es . . . . "Computers and Intractability: A Guide to the Theory of NP-Completeness"@ko . . . "W. H. Freeman and Company" . "QA76.6 .G35" . "x+338"@en . . . . . . . . . . . . . . . . "Computers and Intractability: A Guide to the Theory of NP-Completeness (Computadores e Intratabilidade: Um guia para a Teoria da NP-completude, tradu\u00E7\u00E3o livre, n\u00E3o h\u00E1 edi\u00E7\u00E3o em portugu\u00EAs) \u00E9 um livro de e David S. Johnson de grande influ\u00EAncia em ci\u00EAncia da computa\u00E7\u00E3o, mais especificamente em teoria da complexidade computacional. Foi o primeiro livro a tratar exclusivamente de NP-completude e intratabilidade computacional. O livro apresenta um ap\u00EAndice fornecendo um comp\u00EAndio exaustivo dos problemas NP-completos (que foi atualizado em impress\u00F5es posteriores do livro).O livro j\u00E1 est\u00E1 obsoleto em alguns aspectos, uma vez que n\u00E3o abrange o desenvolvimento mais recente na \u00E1rea como o teorema da Correspond\u00EAncia de Post. \u00C9, no entanto, ainda em vers\u00E3o impressa, considerado como um cl\u00E1ssico: em um estudo de 2006, o motor de busca CiteSeer listou o livro como a refer\u00EAncia mais citada na literatura de ci\u00EAncia da computa\u00E7\u00E3o."@pt . "Computers and Intractability"@pt . . . . "519.4"^^ . . . . "7592"^^ . . "Computers and Intractability: A Guide to the Theory of NP-Completeness (Computadores e Intratabilidade: Um guia para a Teoria da NP-completude, tradu\u00E7\u00E3o livre, n\u00E3o h\u00E1 edi\u00E7\u00E3o em portugu\u00EAs) \u00E9 um livro de e David S. Johnson de grande influ\u00EAncia em ci\u00EAncia da computa\u00E7\u00E3o, mais especificamente em teoria da complexidade computacional. Foi o primeiro livro a tratar exclusivamente de NP-completude e intratabilidade computacional. O livro apresenta um ap\u00EAndice fornecendo um comp\u00EAndio exaustivo dos problemas NP-completos (que foi atualizado em impress\u00F5es posteriores do livro).O livro j\u00E1 est\u00E1 obsoleto em alguns aspectos, uma vez que n\u00E3o abrange o desenvolvimento mais recente na \u00E1rea como o teorema da Correspond\u00EAncia de Post. \u00C9, no entanto, ainda em vers\u00E3o impressa, considerado como um cl\u00E1ssico: em um"@pt . . "Computers and Intractability: A Guide to the Theory of NP-Completeness is a textbook by Michael Garey and David S. Johnson.It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature."@en . "0-7167-1045-5" . . . "Computers and Intractability: A Guide to the Theory of NP-Completeness is a textbook by Michael Garey and David S. Johnson.It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature."@en . . . . . . "1979"^^ . "247570676" . . "14054604"^^ .