<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: An Example of Exponential Runtime</title>
	<atom:link href="http://technofetish.net/buffaloblog/?feed=rss2&#038;p=135" rel="self" type="application/rss+xml" />
	<link>http://technofetish.net/buffaloblog/?p=135</link>
	<description></description>
	<lastBuildDate>Mon, 06 Sep 2010 16:46:00 -0600</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
	<item>
		<title>By: buffalo</title>
		<link>http://technofetish.net/buffaloblog/?p=135&#038;cpage=1#comment-690</link>
		<dc:creator>buffalo</dc:creator>
		<pubDate>Wed, 10 Feb 2010 02:04:14 +0000</pubDate>
		<guid isPermaLink="false">http://technofetish.net/buffaloblog/?p=135#comment-690</guid>
		<description>Ok, I found the textbook that this function was based on.  And indeed, it is not exponential - actually it only checks every pairing of vertexes.  Ok...let me see if I can trick it further.</description>
		<content:encoded><![CDATA[<p>Ok, I found the textbook that this function was based on.  And indeed, it is not exponential &#8211; actually it only checks every pairing of vertexes.  Ok&#8230;let me see if I can trick it further.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
