<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
	>

<channel>
	<title>Constraints</title>
	<atom:link href="http://constraints.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://constraints.wordpress.com</link>
	<description>Turning local information into global solutions</description>
	<lastBuildDate>Sun, 15 Jan 2012 18:29:23 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='constraints.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>Constraints</title>
		<link>http://constraints.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://constraints.wordpress.com/osd.xml" title="Constraints" />
	<atom:link rel='hub' href='http://constraints.wordpress.com/?pushpress=hub'/>
		<item>
		<title>Beware normal hypergraph landmine</title>
		<link>http://constraints.wordpress.com/2011/04/04/beware-normal-hypergraph-landmine/</link>
		<comments>http://constraints.wordpress.com/2011/04/04/beware-normal-hypergraph-landmine/#comments</comments>
		<pubDate>Mon, 04 Apr 2011 00:02:40 +0000</pubDate>
		<dc:creator>András Salamon</dc:creator>
				<category><![CDATA[Commentary]]></category>
		<category><![CDATA[papers]]></category>

		<guid isPermaLink="false">http://constraints.wordpress.com/?p=458</guid>
		<description><![CDATA[In a classic 1972 paper László Lovász proved the (little) Perfect Graph Theorem, that the complement of every perfect graph is perfect. Another theorem from this paper links normal hypergraphs and perfect graphs. Perhaps this discussion will help someone avoid unnecessary grey hairs. A partial hypergraph of a hypergraph consists of the same vertices as [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=constraints.wordpress.com&amp;blog=3478454&amp;post=458&amp;subd=constraints&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://constraints.wordpress.com/2011/04/04/beware-normal-hypergraph-landmine/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/e1e0983f728d272b911332d99d4ff019?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">András</media:title>
		</media:content>
	</item>
		<item>
		<title>New ACC circuit lower bounds</title>
		<link>http://constraints.wordpress.com/2010/11/09/new-acc-circuit-lower-bounds/</link>
		<comments>http://constraints.wordpress.com/2010/11/09/new-acc-circuit-lower-bounds/#comments</comments>
		<pubDate>Tue, 09 Nov 2010 17:25:15 +0000</pubDate>
		<dc:creator>András Salamon</dc:creator>
				<category><![CDATA[Commentary]]></category>
		<category><![CDATA[papers]]></category>

		<guid isPermaLink="false">http://constraints.wordpress.com/?p=448</guid>
		<description><![CDATA[Ryan Williams recently published a draft proving new lower bounds for ACC circuits. ACC (often known as ACC0) is the class of constant depth circuits with unbounded fan-in gates, where the usual AND/OR/NOT gates are supplemented by MODm gates for some constant m. Furst, Saxe, and Sipser in 1981 and Ajtai in 1983 showed that [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=constraints.wordpress.com&amp;blog=3478454&amp;post=448&amp;subd=constraints&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://constraints.wordpress.com/2010/11/09/new-acc-circuit-lower-bounds/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/e1e0983f728d272b911332d99d4ff019?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">András</media:title>
		</media:content>
	</item>
		<item>
		<title>deterministic 3SAT in O*(1.334^n) time</title>
		<link>http://constraints.wordpress.com/2010/08/28/deterministic-3sat-in-o1-334n-time/</link>
		<comments>http://constraints.wordpress.com/2010/08/28/deterministic-3sat-in-o1-334n-time/#comments</comments>
		<pubDate>Sat, 28 Aug 2010 00:31:55 +0000</pubDate>
		<dc:creator>András Salamon</dc:creator>
				<category><![CDATA[Commentary]]></category>
		<category><![CDATA[papers]]></category>

		<guid isPermaLink="false">http://constraints.wordpress.com/?p=437</guid>
		<description><![CDATA[Robin Moser and Dominik Scheder have put an end to the stream of slight improvements in derandomizing Schöning&#8217;s randomized k-SAT algorithm from 1999. In A Full Derandomization of Schöning&#8217;s k-SAT Algorithm, Moser and Scheder show how to achieve worst-case runtime as close as desired to the runtime of the randomized algorithm, for any . For [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=constraints.wordpress.com&amp;blog=3478454&amp;post=437&amp;subd=constraints&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://constraints.wordpress.com/2010/08/28/deterministic-3sat-in-o1-334n-time/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/e1e0983f728d272b911332d99d4ff019?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">András</media:title>
		</media:content>
	</item>
		<item>
		<title>InfiniteStack / TheoryOverflow / CSTheory public beta</title>
		<link>http://constraints.wordpress.com/2010/08/27/infinitestack-theoryoverflow-cstheory-public-beta/</link>
		<comments>http://constraints.wordpress.com/2010/08/27/infinitestack-theoryoverflow-cstheory-public-beta/#comments</comments>
		<pubDate>Fri, 27 Aug 2010 22:46:17 +0000</pubDate>
		<dc:creator>András Salamon</dc:creator>
				<category><![CDATA[Commentary]]></category>
		<category><![CDATA[online science]]></category>

		<guid isPermaLink="false">http://constraints.wordpress.com/?p=433</guid>
		<description><![CDATA[The initial batch of questions and answers at the Theoretical Computer Science Q&#38;A forum seems promising. I encourage theoretical computer scientists to take a look, and to consider contributing. The site has taken its initial cues from MathOverflow, targeting research-level questions in theoretical computer science. The public beta is planned to run for two more [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=constraints.wordpress.com&amp;blog=3478454&amp;post=433&amp;subd=constraints&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://constraints.wordpress.com/2010/08/27/infinitestack-theoryoverflow-cstheory-public-beta/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/e1e0983f728d272b911332d99d4ff019?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">András</media:title>
		</media:content>
	</item>
		<item>
		<title>A simple reduction</title>
		<link>http://constraints.wordpress.com/2010/08/15/a-simple-reduction/</link>
		<comments>http://constraints.wordpress.com/2010/08/15/a-simple-reduction/#comments</comments>
		<pubDate>Sun, 15 Aug 2010 03:01:38 +0000</pubDate>
		<dc:creator>András Salamon</dc:creator>
				<category><![CDATA[Commentary]]></category>
		<category><![CDATA[computational complexity]]></category>
		<category><![CDATA[k-ISOLATED SAT]]></category>

		<guid isPermaLink="false">http://constraints.wordpress.com/?p=391</guid>
		<description><![CDATA[Recent online discussion about computational complexity included the notion that the structure of solutions of SAT might be useful in proving separation results. I want to point out a further obstacle to this idea. Previously I discussed k-ISOLATED SAT, the decision problem which attempts to ramp up the hardness of SAT by requiring not only [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=constraints.wordpress.com&amp;blog=3478454&amp;post=391&amp;subd=constraints&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://constraints.wordpress.com/2010/08/15/a-simple-reduction/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/e1e0983f728d272b911332d99d4ff019?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">András</media:title>
		</media:content>
	</item>
		<item>
		<title>P not equal to NP (P ≠ NP) consequences</title>
		<link>http://constraints.wordpress.com/2010/08/13/p-not-equal-to-np-consequences/</link>
		<comments>http://constraints.wordpress.com/2010/08/13/p-not-equal-to-np-consequences/#comments</comments>
		<pubDate>Fri, 13 Aug 2010 20:43:39 +0000</pubDate>
		<dc:creator>András Salamon</dc:creator>
				<category><![CDATA[Commentary]]></category>
		<category><![CDATA[Question]]></category>
		<category><![CDATA[computational complexity]]></category>

		<guid isPermaLink="false">http://constraints.wordpress.com/?p=369</guid>
		<description><![CDATA[During the discussion about Vinay Deolalikar&#8217;s manuscript, many people commented about the consequences that would follow if we knew that P ≠ NP. I&#8217;d like to discuss these consequences in a little more detail. This is the counterpart to the question of what would happen if we knew that P = NP. Neither question has [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=constraints.wordpress.com&amp;blog=3478454&amp;post=369&amp;subd=constraints&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://constraints.wordpress.com/2010/08/13/p-not-equal-to-np-consequences/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/e1e0983f728d272b911332d99d4ff019?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">András</media:title>
		</media:content>
	</item>
		<item>
		<title>Deolalikar&#8217;s manuscript</title>
		<link>http://constraints.wordpress.com/2010/08/09/deolalikars-manuscript/</link>
		<comments>http://constraints.wordpress.com/2010/08/09/deolalikars-manuscript/#comments</comments>
		<pubDate>Mon, 09 Aug 2010 17:39:10 +0000</pubDate>
		<dc:creator>András Salamon</dc:creator>
				<category><![CDATA[Commentary]]></category>
		<category><![CDATA[computational complexity]]></category>
		<category><![CDATA[papers]]></category>

		<guid isPermaLink="false">http://constraints.wordpress.com/?p=357</guid>
		<description><![CDATA[Given the sudden influx of visitors, it seemed apposite to talk about Vinay Deolalikar&#8217;s manuscript titled (or in words, &#8220;P is not equal to NP&#8221;). (See Richard Lipton&#8217;s discussion of the paper for a download link.) After all, this paper seems to be the prime cause of all the attention. Deolalikar&#8217;s work brings to greater [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=constraints.wordpress.com&amp;blog=3478454&amp;post=357&amp;subd=constraints&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://constraints.wordpress.com/2010/08/09/deolalikars-manuscript/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/e1e0983f728d272b911332d99d4ff019?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">András</media:title>
		</media:content>
	</item>
		<item>
		<title>TheoryOverflow nearing beta</title>
		<link>http://constraints.wordpress.com/2010/08/03/theoryoverflow-nearing-beta/</link>
		<comments>http://constraints.wordpress.com/2010/08/03/theoryoverflow-nearing-beta/#comments</comments>
		<pubDate>Tue, 03 Aug 2010 21:57:05 +0000</pubDate>
		<dc:creator>András Salamon</dc:creator>
				<category><![CDATA[Commentary]]></category>
		<category><![CDATA[online science]]></category>

		<guid isPermaLink="false">http://constraints.wordpress.com/?p=349</guid>
		<description><![CDATA[The TheoryOverflow site was proposed a few weeks ago for discussion of research-level questions in theoretical computer science. I am committed to using this service, and encourage others in the community to try it out. Some of this kind of discussion currently happens online at MathOverflow. This means top mathematicians like Tim Gowers and Terence [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=constraints.wordpress.com&amp;blog=3478454&amp;post=349&amp;subd=constraints&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://constraints.wordpress.com/2010/08/03/theoryoverflow-nearing-beta/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/e1e0983f728d272b911332d99d4ff019?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">András</media:title>
		</media:content>
	</item>
		<item>
		<title>FOCS 2010 accepted papers</title>
		<link>http://constraints.wordpress.com/2010/07/05/focs-2010-accepted-papers/</link>
		<comments>http://constraints.wordpress.com/2010/07/05/focs-2010-accepted-papers/#comments</comments>
		<pubDate>Mon, 05 Jul 2010 01:38:24 +0000</pubDate>
		<dc:creator>András Salamon</dc:creator>
				<category><![CDATA[Commentary]]></category>
		<category><![CDATA[conferences]]></category>
		<category><![CDATA[papers]]></category>

		<guid isPermaLink="false">http://constraints.wordpress.com/?p=317</guid>
		<description><![CDATA[The FOCS 2010 accepted papers were announced a few days ago. This is a quick summary of a few papers that caught my eye. Shiva Kintali has kindly compiled a list of the FOCS 2010 accepted papers, with links to the papers where available. Last year I mentioned Benjamin Rossman&#8217;s monotone complexity result for k-CLIQUE. [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=constraints.wordpress.com&amp;blog=3478454&amp;post=317&amp;subd=constraints&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://constraints.wordpress.com/2010/07/05/focs-2010-accepted-papers/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/e1e0983f728d272b911332d99d4ff019?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">András</media:title>
		</media:content>
	</item>
		<item>
		<title>texorpdfstring in hyperref</title>
		<link>http://constraints.wordpress.com/2010/06/25/texorpdfstring-in%c2%a0hyperref/</link>
		<comments>http://constraints.wordpress.com/2010/06/25/texorpdfstring-in%c2%a0hyperref/#comments</comments>
		<pubDate>Fri, 25 Jun 2010 18:25:23 +0000</pubDate>
		<dc:creator>András Salamon</dc:creator>
				<category><![CDATA[Tips]]></category>

		<guid isPermaLink="false">http://constraints.wordpress.com/?p=305</guid>
		<description><![CDATA[If you use the hyperref package and have seen Package hyperref Warning: Token not allowed in a PDF string when running pdflatex/pdftex, consider using \texorpdfstring to specify the PDF string explicitly. For instance, math mode is not allowed in PDF, so the snippet \section{My $k$-character heading} can be replaced by \section{My \texorpdfstring{$k$}{k}-character heading}. Thorsten (localghost) [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=constraints.wordpress.com&amp;blog=3478454&amp;post=305&amp;subd=constraints&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://constraints.wordpress.com/2010/06/25/texorpdfstring-in%c2%a0hyperref/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/e1e0983f728d272b911332d99d4ff019?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">András</media:title>
		</media:content>
	</item>
	</channel>
</rss>
