<?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[NUST Library Search for 'su:&quot;Computational complexity.&quot;']]> </title> <!-- prettier-ignore-start --> <link> /cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Computational%20complexity.%22&#38;sort_by=relevance&#38;format=rss </link> <!-- prettier-ignore-end --> <atom:link rel="self" type="application/rss+xml" href="/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Computational%20complexity.%22&#38;sort_by=relevance&#38;format=rss" /> <description> <![CDATA[ Search results for 'su:&quot;Computational complexity.&quot;' at NUST 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="/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Computational%20complexity.%22&#38;sort_by=relevance&#38;format=opensearchdescription" /> <opensearch:Query role="request" searchTerms="q%3Dccl%3Dsu%253A%2522Computational%2520complexity.%2522" startPage="" /> <item> <title> Meta maths : the quest for omega / </title> <dc:identifier>ISBN:1843545241 (hbk.)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=128264</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Chaitin, Gregory J..<br /> London : Atlantic Books, 2005 .<br /> xiv, 220 p. : , Includes index. 24 cm..<br /> 1843545241 (hbk.) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=128264">Place hold on <em>Meta maths :</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=128264</guid> </item> <item> <title> Noisy information and computational complexity / </title> <dc:identifier>ISBN:0521553687 (cased)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=142654</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Plaskota, Leszek..<br /> Cambridge : Cambridge University Press, 1996 .<br /> xi, 308 p. ; , Includes indexes. 24 cm..<br /> 0521553687 (cased) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=142654">Place hold on <em>Noisy information and computational complexity /</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=142654</guid> </item> <item> <title> The theory of computability : programs, machines, effectiveness, and feasibility / </title> <dc:identifier>ISBN:0201142147 (pbk.)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=148050</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Sommerhalder, R..<br /> Wokingham : Addison-Wesley, 1988 .<br /> xii, 441 p. ; , Includes index. 24 cm..<br /> 0201142147 (pbk.) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=148050">Place hold on <em>The theory of computability :</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=148050</guid> </item> <item> <title> Elements of the theory of computation / </title> <dc:identifier>ISBN:0132734265 (pbk.)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=148052</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Lewis, Harry R..<br /> Englewood Cliffs, N.J. : Prentice-Hall, 1981 .<br /> xiv, 466 p. : , Includes index. 23 cm..<br /> 0132734265 (pbk.) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=148052">Place hold on <em>Elements of the theory of computation /</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=148052</guid> </item> <item> <title> Algorithms and complexity : recent results and new directions : [proceedings of a Symposium on New Directions and Recent Results in Algorithms and Complexity held by the Computer Science Department, Carnegie-Mellon University, April 7-9, 1976] / </title> <dc:identifier>ISBN:012697540X (hbk.)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=157429</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> New York : Academic Press, 1976 .<br /> ix, 523 p. ; 24 cm..<br /> 012697540X (hbk.) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=157429">Place hold on <em>Algorithms and complexity :</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=157429</guid> </item> <item> <title> Analytic computational complexity / </title> <dc:identifier>ISBN:0126975604 (hbk. )</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=157493</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> New York : Academic Press , 1976 .<br /> ix, 239 p. ; , Includes index. | &quot;Proceedings of the Symposium on Analytic Computational Complexity, held by the Computer Science Department, Carnegie-Mellon University, Pittsburgh, Pennsylvania, on April 7-8, 1975.&quot; 24 cm..<br /> 0126975604 (hbk. ) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=157493">Place hold on <em>Analytic computational complexity /</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=157493</guid> </item> </channel> </rss>
