<?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[SNU Library Search for 'su:&quot;Computational complexity.&quot;']]> </title> <link> https://library.snu.edu.in/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Computational%20complexity.%22&#38;sort_by=&#38;format=rss </link> <atom:link rel="self" type="application/rss+xml" href="https://library.snu.edu.in/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Computational%20complexity.%22&#38;sort_by=&#38;format=rss"/> <description> <![CDATA[ Search results for 'su:&quot;Computational complexity.&quot;' at SNU Library]]> </description> <opensearch:totalResults>6</opensearch:totalResults> <opensearch:startIndex>0</opensearch:startIndex> <opensearch:itemsPerPage>50</opensearch:itemsPerPage> <atom:link rel="search" type="application/opensearchdescription+xml" href="https://library.snu.edu.in/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Computational%20complexity.%22&#38;sort_by=&#38;format=opensearchdescription"/> <opensearch:Query role="request" searchTerms="q%3Dccl%3Dsu%253A%2522Computational%2520complexity.%2522" startPage="" /> <item> <title> Complexity And Approximation : Combinatorial Optimization Problems And Their Approximability Properties </title> <dc:identifier>ISBN:9783540654315</dc:identifier> <link>https://library.snu.edu.in/cgi-bin/koha/opac-detail.pl?biblionumber=7570</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/3540654313.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Ausiello, G. .<br /> New York : Springer, 2003 .<br /> xviii,524p. 9783540654315 </p> ]]> <![CDATA[ <p> <a href="https://library.snu.edu.in/cgi-bin/koha/opac-reserve.pl?biblionumber=7570">Place hold on <em>Complexity And Approximation</em></a> </p> ]]> </description> <guid>https://library.snu.edu.in/cgi-bin/koha/opac-detail.pl?biblionumber=7570</guid> </item> <item> <title> Algorithmics For Hard Problems : Introduction To Combinatorial Optimization, Randomization, Approximation, And Heuristics </title> <dc:identifier>ISBN:9783642079092</dc:identifier> <link>https://library.snu.edu.in/cgi-bin/koha/opac-detail.pl?biblionumber=7571</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/3642079091.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Hromkovic, Juraj.<br /> New York : Springer, 2003 .<br /> xiii, 544 p. ; 24 cm..<br /> 9783642079092 </p> ]]> <![CDATA[ <p> <a href="https://library.snu.edu.in/cgi-bin/koha/opac-reserve.pl?biblionumber=7571">Place hold on <em>Algorithmics For Hard Problems</em></a> </p> ]]> </description> <guid>https://library.snu.edu.in/cgi-bin/koha/opac-detail.pl?biblionumber=7571</guid> </item> <item> <title> Introduction to the theory of computation </title> <dc:identifier>ISBN:9788131517505</dc:identifier> <link>https://library.snu.edu.in/cgi-bin/koha/opac-detail.pl?biblionumber=9540</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8131517500.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Sipser, Michael.<br /> Delhi. : Cengage Learning., 2012 .<br /> xvii, 437 p. ; 24 cm..<br /> 9788131517505 </p> ]]> <![CDATA[ <p> <a href="https://library.snu.edu.in/cgi-bin/koha/opac-reserve.pl?biblionumber=9540">Place hold on <em>Introduction to the theory of computation</em></a> </p> ]]> </description> <guid>https://library.snu.edu.in/cgi-bin/koha/opac-detail.pl?biblionumber=9540</guid> </item> <item> <title> Computational complexity : a modern approach </title> <dc:identifier>ISBN:9780521424264</dc:identifier> <link>https://library.snu.edu.in/cgi-bin/koha/opac-detail.pl?biblionumber=39286</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/0521424267.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Arora, Sanjeev; | Barak, Boaz.<br /> New York : Cambridge University Press, 2009 .<br /> xxiv,579p. 24cm. .<br /> 9780521424264 </p> ]]> <![CDATA[ <p> <a href="https://library.snu.edu.in/cgi-bin/koha/opac-reserve.pl?biblionumber=39286">Place hold on <em>Computational complexity</em></a> </p> ]]> </description> <guid>https://library.snu.edu.in/cgi-bin/koha/opac-detail.pl?biblionumber=39286</guid> </item> <item> <title> Introduction to the theory of computation </title> <dc:identifier>ISBN:9780534950972</dc:identifier> <link>https://library.snu.edu.in/cgi-bin/koha/opac-detail.pl?biblionumber=43380</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/0534950973.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Sipser, Michael.<br /> Boston : Thomson Course Technology 2006 .<br /> xix, 431p. , 25 cm..<br /> 9780534950972 </p> ]]> <![CDATA[ <p> <a href="https://library.snu.edu.in/cgi-bin/koha/opac-reserve.pl?biblionumber=43380">Place hold on <em>Introduction to the theory of computation</em></a> </p> ]]> </description> <guid>https://library.snu.edu.in/cgi-bin/koha/opac-detail.pl?biblionumber=43380</guid> </item> <item> <title> Complexity Of Lattice Problems : a cryptographic perspective </title> <dc:identifier>ISBN:9781461352938</dc:identifier> <link>https://library.snu.edu.in/cgi-bin/koha/opac-detail.pl?biblionumber=59100</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/1461352932.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Micciancio, Daniele.<br /> Boston : Kluwer Academic, 2002 .<br /> x, 220p. 25 cm..<br /> 9781461352938 </p> ]]> <![CDATA[ <p> <a href="https://library.snu.edu.in/cgi-bin/koha/opac-reserve.pl?biblionumber=59100">Place hold on <em>Complexity Of Lattice Problems </em></a> </p> ]]> </description> <guid>https://library.snu.edu.in/cgi-bin/koha/opac-detail.pl?biblionumber=59100</guid> </item> </channel> </rss>
