<node id="453461">
  <nid>453461</nid>
  <type>external_news</type>
  <uid>
    <user id="28124"><![CDATA[28124]]></user>
  </uid>
  <created>1443532663</created>
  <changed>1475893664</changed>
  <title><![CDATA[Lance Fortnow Discusses Advances in Circuit Lower Bounds]]></title>
  <body><![CDATA[<p class="p1">Lance Fortnow comments on a new&nbsp;<a href="http://web.stanford.edu/%7Errwill/acc-lbs.pdf">breakthrough proof</a>&nbsp;for computer science circuit complexity by theorists at Stanford University — calling it “the best progress in circuit lower bounds in nearly a quarter century.”</p>]]></body>
  <field_article_url>
    <item>
      <url><![CDATA[https://www.quantamagazine.org/20150929-edit-distance-computational-complexity/]]></url>
      <title><![CDATA[]]></title>
    </item>
  </field_article_url>
  <field_publication>
    <item>
      <value><![CDATA[ Metz Mayor ]]></value>
    </item>
  </field_publication>
  <field_dateline>
    <item>
      <value>2015-09-29</value>
      <timezone></timezone>
    </item>
  </field_dateline>
  <field_media>
        </field_media>
  <og_groups>
          <item>47223</item>
          <item>50875</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[College of Computing]]></item>
          <item><![CDATA[School of Computer Science]]></item>
      </og_groups_both>
    <field_userdata>
      <![CDATA[]]>
  </field_userdata>
</node>
