<?xml version="1.0" encoding="UTF-8"?>
<GoodreadsResponse>
	<Request>
		<authentication>false</authentication>
		    <method><![CDATA[]]></method>
	</Request>
	
<book>
  <id>284369</id>
  <title><![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]></title>
  <isbn><![CDATA[0716710455]]></isbn>
  <isbn13><![CDATA[9780716710455]]></isbn13>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <description><![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]></description>
  <work>
  <best_book_id type="integer">284369</best_book_id>
  <books_count type="integer">1</books_count>
  <desc_user_id type="integer" nil="true"></desc_user_id>
  <id type="integer">275886</id>
  <media_type nil="true"></media_type>
  <original_language_id type="integer" nil="true"></original_language_id>
  <original_publication_day type="integer">15</original_publication_day>
  <original_publication_month type="integer">1</original_publication_month>
  <original_publication_year type="integer">1979</original_publication_year>
  <original_title>Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)</original_title>
  <rating_dist>total:8|5:4|4:3|3:1|</rating_dist>
  <ratings_count type="integer">8</ratings_count>
  <ratings_sum type="integer">35</ratings_sum>
  <reviews_count type="integer">26</reviews_count>
  <text_reviews_count type="integer">2</text_reviews_count>
</work>

  <average_rating><![CDATA[4.38]]></average_rating>
  <ratings_count><![CDATA[8]]></ratings_count>
  <text_reviews_count><![CDATA[2]]></text_reviews_count>
  
  <url><![CDATA[http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness]]></url>
  <link><![CDATA[http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness]]></link>
  <authors>
    <author>
    <id>165121</id>
        <name><![CDATA[M.R. Garey]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/165121.M_R_Garey]]></link>
    <average_rating>4.38</average_rating>
    <ratings_count>8</ratings_count>
    <text_reviews_count>2</text_reviews_count>
  </author>
  </authors>
    <reviews start="1" end="20" total="26">
      <review>
  <id>20353726</id>
    <user>
    <id>1027339</id>
    <name><![CDATA[dead letter office]]></name>
    <location><![CDATA[South Hadley, MA]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1027339-dead-letter-office]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1209864968p3/1027339.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1209864968p2/1027339.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>5</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="texts" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Wed Apr 16 22:10:35 -0700 2008</date_added>
  <date_updated>Wed Apr 16 22:10:35 -0700 2008</date_updated>
  <read_count></read_count>
    <body><![CDATA[as an introduction to NP-completeness, it's good. as a reference on NP-completeness it's by far the best. like 200 pages of NP-complete problems with references to NP-hard problems to reduce to prove NP-completeness.]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/20353726]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/20353726]]></link>
</review>
      <review>
  <id>18426515</id>
    <user>
    <id>655723</id>
    <name><![CDATA[Nick]]></name>
    <location><![CDATA[Atlanta, GA]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/655723-nick]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1261874094p3/655723.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1261874094p2/655723.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>5</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at>Fri Feb 01 00:00:00 -0800 2008</read_at>
  <date_added>Sun Mar 23 01:02:47 -0700 2008</date_added>
  <date_updated>Sun Mar 23 04:51:44 -0700 2008</date_updated>
  <read_count></read_count>
    <body><![CDATA[The first really good book on the class NP I've found -- an absolute lifesaver when I realized how little I understood the core of NP.]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/18426515]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/18426515]]></link>
</review>
      <review>
  <id>78638580</id>
    <user>
    <id>2268395</id>
    <name><![CDATA[Lars]]></name>
    <location><![CDATA[Stockholm, 26, Sweden]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2268395-lars-westergren]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1240998053p3/2268395.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1240998053p2/2268395.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Sun Nov 22 11:08:18 -0800 2009</date_added>
  <date_updated>Sun Nov 22 11:08:18 -0800 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/78638580]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/78638580]]></link>
</review>
      <review>
  <id>61511442</id>
    <user>
    <id>2470802</id>
    <name><![CDATA[Redondos]]></name>
    <location><![CDATA[Redwood City, CA]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2470802-redondos]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-U-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-U-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Mon Jun 29 10:18:09 -0700 2009</date_added>
  <date_updated>Mon Jun 29 10:18:09 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/61511442]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/61511442]]></link>
</review>
      <review>
  <id>58369247</id>
    <user>
    <id>361189</id>
    <name><![CDATA[Nick]]></name>
    <location><![CDATA[The United States]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/361189-nick-peters]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="to-read" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Wed Jun 03 19:51:09 -0700 2009</date_added>
  <date_updated>Wed Jun 03 19:51:09 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/58369247]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/58369247]]></link>
</review>
      <review>
  <id>56962181</id>
    <user>
    <id>2342856</id>
    <name><![CDATA[Brad]]></name>
    <location><![CDATA[Chicago, IL]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2342856-brad]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1242955598p3/2342856.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1242955598p2/2342856.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="to-read" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Fri May 22 09:12:03 -0700 2009</date_added>
  <date_updated>Fri May 22 09:12:03 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/56962181]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/56962181]]></link>
</review>
      <review>
  <id>56025567</id>
    <user>
    <id>2101427</id>
    <name><![CDATA[Andreas]]></name>
    <location><![CDATA[Stockholm, 26, Sweden]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2101427-andreas-knifh]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="to-read" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Wed May 13 23:31:56 -0700 2009</date_added>
  <date_updated>Wed May 13 23:31:56 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/56025567]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/56025567]]></link>
</review>
      <review>
  <id>54547271</id>
    <user>
    <id>1371896</id>
    <name><![CDATA[Dave]]></name>
    <location><![CDATA[The United States]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1371896-dave]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="to-read" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Thu Apr 30 20:29:58 -0700 2009</date_added>
  <date_updated>Thu Apr 30 20:29:58 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/54547271]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/54547271]]></link>
</review>
      <review>
  <id>53505441</id>
    <user>
    <id>2197679</id>
    <name><![CDATA[v]]></name>
    <location><![CDATA[The United States]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2197679-v]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1239228105p3/2197679.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1239228105p2/2197679.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>4</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
            <shelf name="science" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Tue Apr 21 14:48:19 -0700 2009</date_added>
  <date_updated>Tue Apr 21 14:48:19 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/53505441]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/53505441]]></link>
</review>
      <review>
  <id>51832399</id>
    <user>
    <id>275207</id>
    <name><![CDATA[Corban]]></name>
    <location><![CDATA[Dallas, TX]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/275207-corban]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1222106786p3/275207.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1222106786p2/275207.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="to-read" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Tue Apr 07 12:24:04 -0700 2009</date_added>
  <date_updated>Tue Apr 07 13:03:33 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/51832399]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/51832399]]></link>
</review>
      <review>
  <id>47158847</id>
    <user>
    <id>2060216</id>
    <name><![CDATA[Mangesh]]></name>
    <location><![CDATA[The United States]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2060216-mangesh]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Sun Feb 22 11:16:21 -0800 2009</date_added>
  <date_updated>Sun Feb 22 11:16:21 -0800 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/47158847]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/47158847]]></link>
</review>
      <review>
  <id>43923113</id>
    <user>
    <id>1829230</id>
    <name><![CDATA[Wildstar]]></name>
    <location><![CDATA[Italy]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1829230-wildstar]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1231445301p3/1829230.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1231445301p2/1829230.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>4</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
            <shelf name="computer-science" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Thu Jan 22 08:13:34 -0800 2009</date_added>
  <date_updated>Thu Jan 22 08:13:34 -0800 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/43923113]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/43923113]]></link>
</review>
      <review>
  <id>42175988</id>
    <user>
    <id>1836411</id>
    <name><![CDATA[John]]></name>
    <location><![CDATA[The United States]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1836411-john]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="to-read" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Tue Jan 06 20:17:06 -0800 2009</date_added>
  <date_updated>Wed Jan 07 02:09:12 -0800 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/42175988]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/42175988]]></link>
</review>
      <review>
  <id>42139612</id>
    <user>
    <id>1402237</id>
    <name><![CDATA[Phiroze]]></name>
    <location><![CDATA[The United States]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1402237-phiroze]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Tue Jan 06 15:07:05 -0800 2009</date_added>
  <date_updated>Tue Jan 06 15:07:05 -0800 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/42139612]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/42139612]]></link>
</review>
      <review>
  <id>40616803</id>
    <user>
    <id>97383</id>
    <name><![CDATA[.]]></name>
    <location><![CDATA[Madison, WI]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/97383]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-U-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-U-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="-" />
        <shelf name="computer-science" />
        <shelf name="own" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Sun Dec 21 14:58:21 -0800 2008</date_added>
  <date_updated>Sun Dec 21 14:58:21 -0800 2008</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/40616803]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/40616803]]></link>
</review>
      <review>
  <id>39131728</id>
    <user>
    <id>1767898</id>
    <name><![CDATA[Alan]]></name>
    <location><![CDATA[Atlanta, GA]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1767898-alan-fay]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1228237356p3/1767898.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1228237356p2/1767898.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>3</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
            <shelf name="owned" />
        <shelf name="programming" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Tue Dec 02 13:22:05 -0800 2008</date_added>
  <date_updated>Tue Dec 02 13:22:05 -0800 2008</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/39131728]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/39131728]]></link>
</review>
      <review>
  <id>39004894</id>
    <user>
    <id>206483</id>
    <name><![CDATA[DJ]]></name>
    <location><![CDATA[Los Angeles, CA]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/206483-dj]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1211130168p3/206483.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1211130168p2/206483.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="computer-science" />
        <shelf name="to-read" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[David Ruelle]]></recommended_by>
  <read_at></read_at>
  <date_added>Sun Nov 30 23:13:56 -0800 2008</date_added>
  <date_updated>Sat Jul 04 01:17:01 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/39004894]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/39004894]]></link>
</review>
      <review>
  <id>38095732</id>
    <user>
    <id>1187451</id>
    <name><![CDATA[Mando]]></name>
    <location><![CDATA[Austin, TX]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1187451-mando-escamilla]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1211840639p3/1187451.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1211840639p2/1187451.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="tech-books" />
        <shelf name="to-read" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Tue Nov 18 18:44:28 -0800 2008</date_added>
  <date_updated>Tue Nov 18 18:44:34 -0800 2008</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/38095732]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/38095732]]></link>
</review>
      <review>
  <id>37992579</id>
    <user>
    <id>1668780</id>
    <name><![CDATA[Eric]]></name>
    <location><![CDATA[Boston, MA]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1668780-eric]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="to-read" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Mon Nov 17 17:42:21 -0800 2008</date_added>
  <date_updated>Mon Nov 17 17:42:25 -0800 2008</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/37992579]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/37992579]]></link>
</review>
      <review>
  <id>37829098</id>
    <user>
    <id>1496544</id>
    <name><![CDATA[Mark]]></name>
    <location><![CDATA[Canada]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1496544-mark]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1220791779p3/1496544.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1220791779p2/1496544.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">284369</id>
  <isbn>0716710455</isbn>
  <isbn13>9780716710455</isbn13>
  <text_reviews_count type="integer">2</text_reviews_count>
  <title>
    <![CDATA[Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1223676200m/284369.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1223676200s/284369.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/284369.Computers_and_Intractability_A_Guide_to_the_Theory_of_NP_Completeness</link>
  <average_rating>4.38</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, &quot;I can't find an efficient algorithm, but neither can all these famous people.&quot; This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.<p> The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; <em>Computers and Intractability</em> does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) <em>Computers and Intractability</em> also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.</p>]]>
  </description>
  <published>1979</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="tech-business" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Sat Nov 15 18:03:20 -0800 2008</date_added>
  <date_updated>Sat Nov 15 18:03:23 -0800 2008</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/37829098]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/37829098]]></link>
</review>
    </reviews>
  <popular_shelves>
          <shelf name="to-read" />
          <shelf name="computer-science" />
          <shelf name="currently-reading" />
          <shelf name="science" />
          <shelf name="programming" />
          <shelf name="-" />
          <shelf name="tech-business" />
          <shelf name="tech-books" />
      </popular_shelves>
  <book_links>
    <book_link>
  <id>8</id>
  <name><![CDATA[WorldCat]]></name>
  <link>http://www.goodreads.com/book_link/follow/8?book_id=284369</link>
</book_link>
  </book_links>
</book>
</GoodreadsResponse>