<?xml version="1.0" encoding="UTF-8" ?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>complexityweblog at Yahoo! Groups</title>
    <link>http://tech.groups.yahoo.com/group/complexityweblog/</link>
    <description>Computational Complexity Weblog</description>

    <item>
      <title>[Computational Complexity] Axioms: What should we believe?</title>
      <pubDate>Tue, 05 Jan 2010 17:23:43 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1502</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1502</guid>
      <description>Some misc thoughts on set theory inspired by yesterdays comments and other things. - Geometry: Use Euclidean Geometry when appropriate, for example if you are</description>
    </item>
    <item>
      <title>[Computational Complexity] Voting on Mathematical Truths: The Axiom </title>
      <pubDate>Mon, 04 Jan 2010 17:13:48 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1501</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1501</guid>
      <description>One of the founders of Conservapedia (a conservative alternative to Wikipedia) said the following on The Colbert Report: There is an absolute truth. People</description>
    </item>
    <item>
      <title>[Computational Complexity] 2009 Complexity Year in Review</title>
      <pubDate>Mon, 28 Dec 2009 12:15:20 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1500</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1500</guid>
      <description>We go all the way back to January for the paper of the year, Mark Braverman&#39;s Poly-logarithmic independence fools AC0 circuits. Runners up include the</description>
    </item>
    <item>
      <title>[Computational Complexity] How to tell how good a TV show is</title>
      <pubDate>Tue, 22 Dec 2009 17:03:24 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1499</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1499</guid>
      <description>(This is my last blog of the year. Lance will interupt his blog sabbatical to do an END OF THE YEAR blog later.) The TV show MONK recently finished its 8th and</description>
    </item>
    <item>
      <title>[Computational Complexity] What is an explicit Construction?</title>
      <pubDate>Fri, 18 Dec 2009 16:36:47 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1498</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1498</guid>
      <description>The Prob method (usually credited to Erdos) was once considered quite novel: You show something exists but you don&#39;t show how to construct it! An early example</description>
    </item>
    <item>
      <title>[Computational Complexity] A hard problem inspired by an easy proble</title>
      <pubDate>Thu, 17 Dec 2009 15:30:11 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1497</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1497</guid>
      <description>The following problem was problem 1 (the easy one) on the Maryland Math Competition 2009 (I will later report on how the students did on it). - Show that for</description>
    </item>
    <item>
      <title>[Computational Complexity] Guest Post- Women in Theory Workshop</title>
      <pubDate>Wed, 16 Dec 2009 16:21:48 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1496</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1496</guid>
      <description>(Tal Rabin requested to post this so I am doing so. This post is essentially her email, so call it a guest post.) There will be a Women In Theory workshop for</description>
    </item>
    <item>
      <title>[Computational Complexity] Mild Request for Guest Posters.</title>
      <pubDate>Tue, 15 Dec 2009 15:37:34 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1495</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1495</guid>
      <description>(Deadline to submit a paper to CCC is Dec 15. Depending on when you read this that could be today or in the past.) As you all know from Lance&#39;s last post,</description>
    </item>
    <item>
      <title>[Computational Complexity] CCC deadline Dec 15, 2009! (not factorial</title>
      <pubDate>Mon, 14 Dec 2009 17:25:08 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1494</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1494</guid>
      <description>Submissions to 25th CCC are due TOMORROW! (Actually it could be TOMORROW, TODAY, or IN THE PAST depending on when you read this.) Should you submit? - If you</description>
    </item>
    <item>
      <title>[Computational Complexity] CCC deadline Dec 15, 2009! (not factorial</title>
      <pubDate>Mon, 14 Dec 2009 17:23:48 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1493</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1493</guid>
      <description>Submissions to 25th CCC are due TOMMOROW! (Actually it could be TOMMOROW, TODAY, or IN THE PAST depending on when you read this.) Should you submit? - If you</description>
    </item>
    <item>
      <title>[Computational Complexity] A Blog Sabbatical</title>
      <pubDate>Fri, 11 Dec 2009 11:41:59 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1492</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1492</guid>
      <description>With the end of the fall quarter I will take a break from the blog for a few months. This is not another End, just a chance to move my creative juices in</description>
    </item>
    <item>
      <title>[Computational Complexity] Whats your Game Mr. Bond? Nim?</title>
      <pubDate>Thu, 10 Dec 2009 17:00:17 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1491</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1491</guid>
      <description>BILL: Clyde is teaching a graduate course titled Games, Game Theory, and the Theory of Games. He tells me that there are basically eight kinds of games</description>
    </item>
    <item>
      <title>[Computational Complexity] Is posting about 17x17 problem BAD FOR AC</title>
      <pubDate>Wed, 09 Dec 2009 17:08:42 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1490</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1490</guid>
      <description>(The 17x17 problem has gotten far wider attention than I imagined--- Brian Hayes posted it on his website: here, and its also here and here. The last website</description>
    </item>
    <item>
      <title>[Computational Complexity] Dequantification</title>
      <pubDate>Tue, 08 Dec 2009 16:06:16 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1489</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1489</guid>
      <description>After a talk on derandomization at Midwest Theory Day, someone asked if those techniques could also be used in quantum computing. In classical randomness under</description>
    </item>
    <item>
      <title>[Computational Complexity] Complexity Vidcast 3</title>
      <pubDate>Mon, 07 Dec 2009 12:33:11 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1488</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1488</guid>
      <description>Quick announcement: If you are a student who wants to go to SODA but doesn&#39;t have the funds, click here. I had forgotten we did this. Here&#39;s a video of my</description>
    </item>

  </channel>
</rss>
<!-- wr2.grp.sp2.yahoo.com uncompressed/chunked Sat Feb 13 06:46:45 PST 2010 -->
