<?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 for Center for Computational Intractability</title>
	<atom:link href="http://intractability.princeton.edu/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://intractability.princeton.edu</link>
	<description></description>
	<lastBuildDate>Mon, 31 Dec 2012 22:24:43 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>Comment on Workshop: Approximation Algorithms: The Last Decade and the Next &#8211; June 13-17, 2011 by Approximation Algorithms Workshop, Princeton 2011 &#124; etc. and everything else</title>
		<link>http://intractability.princeton.edu/blog/2010/07/workshop-approximation-algorithms-the-last-decade-and-the-next/comment-page-1/#comment-645</link>
		<dc:creator>Approximation Algorithms Workshop, Princeton 2011 &#124; etc. and everything else</dc:creator>
		<pubDate>Mon, 31 Dec 2012 22:24:43 +0000</pubDate>
		<guid isPermaLink="false">http://intractability.princeton.edu/?p=1351#comment-645</guid>
		<description>[...] Center for Computational Intractability at Princeton University. The particular workshop is this one, the purpose being to recap the last decade of advances in this field and to set the direction for [...]</description>
		<content:encoded><![CDATA[<p>[...] Center for Computational Intractability at Princeton University. The particular workshop is this one, the purpose being to recap the last decade of advances in this field and to set the direction for [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Center Meeting: Arithmetic Circuit Lower Bounds – November 9, 2012 by Lecture 4 &#171; Topics in Circuit Lower Bounds</title>
		<link>http://intractability.princeton.edu/blog/2012/11/center-meeting-arithmetic-circuit-lower-bounds-november-9-2012/comment-page-1/#comment-637</link>
		<dc:creator>Lecture 4 &#171; Topics in Circuit Lower Bounds</dc:creator>
		<pubDate>Wed, 28 Nov 2012 20:15:09 +0000</pubDate>
		<guid isPermaLink="false">http://intractability.princeton.edu/?p=2429#comment-637</guid>
		<description>[...] See an alternative proof by Dana Moshkovitz (who was a Ph.D. student at Weizmann). There is a great, recent survey talk by Ran Raz about arithmetic [...]</description>
		<content:encoded><![CDATA[<p>[...] See an alternative proof by Dana Moshkovitz (who was a Ph.D. student at Weizmann). There is a great, recent survey talk by Ran Raz about arithmetic [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Theory Lunch &#8211; Fall 2009 by Serge</title>
		<link>http://intractability.princeton.edu/blog/2009/12/ankur-moitra-at-theory-lunch/comment-page-1/#comment-511</link>
		<dc:creator>Serge</dc:creator>
		<pubDate>Thu, 12 Jul 2012 18:27:11 +0000</pubDate>
		<guid isPermaLink="false">http://intractability.princeton.edu/?p=1082#comment-511</guid>
		<description>Wow ! The independance from the graph size is a big step forward.
I do &quot;play&quot; with some very large graphs, and such work are very welcome.</description>
		<content:encoded><![CDATA[<p>Wow ! The independance from the graph size is a big step forward.<br />
I do &quot;play&quot; with some very large graphs, and such work are very welcome.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on New Paper on Complexity and Financial Derivatives by Daily Kos, Boingboing highlight paper by complexity theorists &#124; EQN</title>
		<link>http://intractability.princeton.edu/blog/2009/10/new-paper-on-complexity-and-financial-derivatives/comment-page-1/#comment-510</link>
		<dc:creator>Daily Kos, Boingboing highlight paper by complexity theorists &#124; EQN</dc:creator>
		<pubDate>Tue, 12 Jun 2012 14:44:36 +0000</pubDate>
		<guid isPermaLink="false">http://intractability.princeton.edu/?p=875#comment-510</guid>
		<description>[...] Arora, Boaz Barak, Markus Brunnermeier,&#160;and Rong Ge.&#160;Arora and Barak are with Princeton&#039;s Center for Computational Intractability&#160;and coauthors of Computational Complexity: A Modern Approach, published earlier this year by [...]</description>
		<content:encoded><![CDATA[<p>[...] Arora, Boaz Barak, Markus Brunnermeier,&nbsp;and Rong Ge.&nbsp;Arora and Barak are with Princeton&#039;s Center for Computational Intractability&nbsp;and coauthors of Computational Complexity: A Modern Approach, published earlier this year by [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Workshop: Approximation Algorithms: The Last Decade and the Next &#8211; June 13-17, 2011 by Getting the &#8220;Big Picture&#8221; &#8211; Algorithmic Frontiers Workshop, June 11-14, 2012 &#8211; EPFL &#124; Staring at the Sun</title>
		<link>http://intractability.princeton.edu/blog/2010/07/workshop-approximation-algorithms-the-last-decade-and-the-next/comment-page-1/#comment-471</link>
		<dc:creator>Getting the &#8220;Big Picture&#8221; &#8211; Algorithmic Frontiers Workshop, June 11-14, 2012 &#8211; EPFL &#124; Staring at the Sun</dc:creator>
		<pubDate>Sun, 05 Feb 2012 02:34:01 +0000</pubDate>
		<guid isPermaLink="false">http://intractability.princeton.edu/?p=1351#comment-471</guid>
		<description>[...] I am a bit concerned that &#8211; with a notable exception of the last year&#8217;s workshop in Princeton &#8211; I am not really aware of any forum that aims at reinforcing this kind of [...]</description>
		<content:encoded><![CDATA[<p>[...] I am a bit concerned that &#8211; with a notable exception of the last year&#8217;s workshop in Princeton &#8211; I am not really aware of any forum that aims at reinforcing this kind of [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Workshop: Women in Theory 2010 &#8211; June 19-23, 2010 by Women in Theory 2010 Videos</title>
		<link>http://intractability.princeton.edu/blog/2009/11/women-in-theory-2010-workshop/comment-page-1/#comment-294</link>
		<dc:creator>Women in Theory 2010 Videos</dc:creator>
		<pubDate>Tue, 10 Jan 2012 05:45:35 +0000</pubDate>
		<guid isPermaLink="false">http://intractability.princeton.edu/?p=981#comment-294</guid>
		<description>[...] of lectures given at the Women in Theory 2010 workshop are now available for watching online on &#160;iTunes U and also at the Engineering [...]</description>
		<content:encoded><![CDATA[<p>[...] of lectures given at the Women in Theory 2010 workshop are now available for watching online on &nbsp;iTunes U and also at the Engineering [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Workshop: Approximation Algorithms: The Last Decade and the Next &#8211; June 13-17, 2011 by Approximation Algorithms Workshop, Princeton 2011 &#171; etc. and everything else</title>
		<link>http://intractability.princeton.edu/blog/2010/07/workshop-approximation-algorithms-the-last-decade-and-the-next/comment-page-1/#comment-281</link>
		<dc:creator>Approximation Algorithms Workshop, Princeton 2011 &#171; etc. and everything else</dc:creator>
		<pubDate>Sat, 18 Jun 2011 17:52:28 +0000</pubDate>
		<guid isPermaLink="false">http://intractability.princeton.edu/?p=1351#comment-281</guid>
		<description>[...] Center for Computational Intractability at Princeton University. The particular workshop is this one, the purpose being to recap the last decade of advances in this field and to set the direction for [...]</description>
		<content:encoded><![CDATA[<p>[...] Center for Computational Intractability at Princeton University. The particular workshop is this one, the purpose being to recap the last decade of advances in this field and to set the direction for [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Tips for Princeton Visitors by Workshop : Counting, Inference and Optimization on Graphs : Center for Computational Intractability</title>
		<link>http://intractability.princeton.edu/contact-us/tips-for-princeton-visitors/comment-page-1/#comment-276</link>
		<dc:creator>Workshop : Counting, Inference and Optimization on Graphs : Center for Computational Intractability</dc:creator>
		<pubDate>Thu, 26 May 2011 23:22:37 +0000</pubDate>
		<guid isPermaLink="false">http://intractability.princeton.edu/?page_id=937#comment-276</guid>
		<description>[...] Tips for Princeton Visitors [...]</description>
		<content:encoded><![CDATA[<p>[...] Tips for Princeton Visitors [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Tips for Princeton Visitors by Workshop &#8211; Approximation Algorithms: The Last Decade and the Next : Center for Computational Intractability</title>
		<link>http://intractability.princeton.edu/contact-us/tips-for-princeton-visitors/comment-page-1/#comment-269</link>
		<dc:creator>Workshop &#8211; Approximation Algorithms: The Last Decade and the Next : Center for Computational Intractability</dc:creator>
		<pubDate>Thu, 17 Mar 2011 17:47:57 +0000</pubDate>
		<guid isPermaLink="false">http://intractability.princeton.edu/?page_id=937#comment-269</guid>
		<description>[...] Tips for Princeton Visitors [...]</description>
		<content:encoded><![CDATA[<p>[...] Tips for Princeton Visitors [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Workshop: Geometric Complexity Theory &#8211; July 6-7, 2010 by Twitted by fortnow</title>
		<link>http://intractability.princeton.edu/blog/2009/12/geometric-complexity-theory-workshop/comment-page-1/#comment-13</link>
		<dc:creator>Twitted by fortnow</dc:creator>
		<pubDate>Mon, 04 Jan 2010 19:47:02 +0000</pubDate>
		<guid isPermaLink="false">http://intractability.princeton.edu/?p=1066#comment-13</guid>
		<description>[...] This post was Twitted by fortnow [...]</description>
		<content:encoded><![CDATA[<p>[...] This post was Twitted by fortnow [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
