<?xml version="1.0" encoding="utf-8" ?> <rss version="2.0" xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"> <channel> <title> <![CDATA[H.T. Parekh Library Search for 'an:173']]> </title> <!-- prettier-ignore-start --> <link> http://library.krea.edu.in//cgi-bin/koha/opac-search.pl?q=ccl=an%3A173&#38;sort_by=relevance&#38;format=rss </link> <!-- prettier-ignore-end --> <atom:link rel="self" type="application/rss+xml" href="http://library.krea.edu.in//cgi-bin/koha/opac-search.pl?q=ccl=an%3A173&#38;sort_by=relevance&#38;format=rss" /> <description> <![CDATA[ Search results for 'an:173' at H.T. Parekh Library]]> </description> <opensearch:totalResults>3</opensearch:totalResults> <opensearch:startIndex>0</opensearch:startIndex> <opensearch:itemsPerPage>50</opensearch:itemsPerPage> <atom:link rel="search" type="application/opensearchdescription+xml" href="http://library.krea.edu.in//cgi-bin/koha/opac-search.pl?q=ccl=an%3A173&#38;sort_by=relevance&#38;format=opensearchdescription" /> <opensearch:Query role="request" searchTerms="q%3Dccl%3Dan%253A173" startPage="" /> <item> <title> Computational complexity: a modern approach / </title> <dc:identifier>ISBN:9780521424264 (hbk.)</dc:identifier> <!-- prettier-ignore-start --> <link>http://library.krea.edu.in//cgi-bin/koha/opac-detail.pl?biblionumber=124384</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/0521424267.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Arora, Sanjeev,.<br /> New York : Cambridge University Press, 2016 .<br /> xxiv, 579 p. : 27 cm..<br /> 9780521424264 (hbk.) </p> ]]> <![CDATA[ <p> <a href="http://library.krea.edu.in//cgi-bin/koha/opac-reserve.pl?biblionumber=124384">Place hold on <em>Computational complexity: a modern approach /</em></a> </p> ]]> </description> <guid>http://library.krea.edu.in//cgi-bin/koha/opac-detail.pl?biblionumber=124384</guid> </item> <item> <title> Communication complexity / </title> <dc:identifier>ISBN:9780521029834 (pbk.)</dc:identifier> <!-- prettier-ignore-start --> <link>http://library.krea.edu.in//cgi-bin/koha/opac-detail.pl?biblionumber=124387</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/052102983X.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Kushilevitz, Eyal,.<br /> Cambridge : Cambridge University Press, 1997 .<br /> xiii, 189 p. : 26 cm..<br /> 9780521029834 (pbk.) </p> ]]> <![CDATA[ <p> <a href="http://library.krea.edu.in//cgi-bin/koha/opac-reserve.pl?biblionumber=124387">Place hold on <em>Communication complexity /</em></a> </p> ]]> </description> <guid>http://library.krea.edu.in//cgi-bin/koha/opac-detail.pl?biblionumber=124387</guid> </item> <item> <title> Combinatorial optimization: algorithms and complexity / </title> <dc:identifier>ISBN:9780486402581 (pbk.)</dc:identifier> <!-- prettier-ignore-start --> <link>http://library.krea.edu.in//cgi-bin/koha/opac-detail.pl?biblionumber=124388</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/0486402584.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Papadimitriou, Christos H.,.<br /> New York : Dover Publications, 1998 .<br /> xvi, 496 p. : 22 cm..<br /> 9780486402581 (pbk.) </p> ]]> <![CDATA[ <p> <a href="http://library.krea.edu.in//cgi-bin/koha/opac-reserve.pl?biblionumber=124388">Place hold on <em>Combinatorial optimization: algorithms and complexity /</em></a> </p> ]]> </description> <guid>http://library.krea.edu.in//cgi-bin/koha/opac-detail.pl?biblionumber=124388</guid> </item> </channel> </rss>
