<?xml version="1.0" encoding="iso-8859-1"?>
<rss version="2.0">
  <channel>
    <title>Computer Science</title>
    <link>http://sneetches.net/cs/</link>
    <description>Essential Abstractions</description>
    <language>en-us</language>           
    <generator>Nucleus CMS v3.32</generator>
    <copyright>ï¿½</copyright>             
    <category>Weblog</category>
    <docs>http://backend.userland.com/rss</docs>
    <image>
      <url>http://sneetches.net/cs//nucleus/nucleus2.gif</url>
      <title>Computer Science</title>
      <link>http://sneetches.net/cs/</link>
    </image>
    <item>
 <title>Does P = NP?</title>
 <link>http://sneetches.net/cs/index.php?itemid=3</link>
<description><![CDATA[Lose some sleep over this one.  The general consensus is that P &sub; NP, but that P &ne; NP.<br />
<br />
The real problem (for now) is proving that either P = NP or P &ne; NP.]]></description>
 <category>Algorithms</category>
<comments>http://sneetches.net/cs/index.php?itemid=3</comments>
 <pubDate>Fri, 12 Dec 2008 20:52:52 -0600</pubDate>
</item>
  </channel>
</rss>
