<?xml version="1.0" encoding="UTF-8"?>
<GoodreadsResponse>
	<Request>
		<authentication>false</authentication>
		    <method><![CDATA[]]></method>
	</Request>
	<author>
  
  <id>165121</id>
  <name><![CDATA[M.R. Garey]]></name>
  <link><![CDATA[http://www.goodreads.com/author/show/165121.M_R_Garey]]></link>
  <fans_count type="integer">0</fans_count>
  <followers_count type="integer">0</followers_count>
  <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
  <about><![CDATA[]]></about>
  <influences><![CDATA[]]></influences>
  <gender></gender>
  <hometown></hometown>
  <born_at></born_at>
  <died_at></died_at>
  
  <books>
        <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>
  <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>
<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>
    <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></book>

      <books>
</author>
</GoodreadsResponse>