<?xml version="1.0" encoding="UTF-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
  <title>e-sygoing.link — Complexity Theory</title>
  <link>https://e-sygoing.link</link>
  <description>Latest links in the Complexity Theory category</description>
  <language>en-us</language>
  <lastBuildDate>Sun, 24 May 2026 15:17:43 -0400</lastBuildDate>
  <atom:link href="https://e-sygoing.link/rss.php?type=new&amp;cid=95158"
             rel="self" type="application/rss+xml"/>
    <item>
    <title>Information-based Complexity</title>
    <link>https://e-sygoing.link/link/5758635-information-based-complexity</link>
    <description>People, publications, prizes.</description>
    <pubDate>Fri, 27 Mar 2026 08:46:20 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5758635</guid>
  </item>
    <item>
    <title>ECCC - Electronic Colloquium on Computational Complexity</title>
    <link>https://e-sygoing.link/link/5758630-eccc-electronic-colloquium-on-computational-complexity</link>
    <description>A forum for the rapid and  widespread interchange of ideas, techniques, and research in computational complexity.  Research reports, surveys and books; meetings, discussions and web resources.</description>
    <pubDate>Fri, 19 Sep 2025 18:21:01 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5758630</guid>
  </item>
    <item>
    <title>SAT Live!</title>
    <link>https://e-sygoing.link/link/5758631-sat-live</link>
    <description>A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.</description>
    <pubDate>Thu, 29 May 2025 12:12:27 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5758631</guid>
  </item>
    <item>
    <title>A Compendium of NP Optimization Problems</title>
    <link>https://e-sygoing.link/link/5758629-a-compendium-of-np-optimization-problems</link>
    <description>This is a preliminary version of the catalog of NP optimization problems.</description>
    <pubDate>Thu, 15 May 2025 02:36:24 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5758629</guid>
  </item>
    <item>
    <title>Constraint Satisfaction Problems</title>
    <link>https://e-sygoing.link/link/5758637-constraint-satisfaction-problems</link>
    <description>Research group in the Computing Laboratory, Oxford University.</description>
    <pubDate>Mon, 31 Mar 2025 19:52:44 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5758637</guid>
  </item>
    <item>
    <title>Computational Complexity Theory</title>
    <link>https://e-sygoing.link/link/5758643-computational-complexity-theory</link>
    <description>Wikipedia article.</description>
    <pubDate>Sat, 22 Mar 2025 04:31:30 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5758643</guid>
  </item>
    <item>
    <title>Probabilistically Checkable Proofs and Approximation</title>
    <link>https://e-sygoing.link/link/5758639-probabilistically-checkable-proofs-and-approximation</link>
    <description>Pointers to some survey articles and their authors, by M. Bellare.</description>
    <pubDate>Thu, 26 Dec 2024 22:08:52 -0500</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5758639</guid>
  </item>
    <item>
    <title>Complexity Theory</title>
    <link>https://e-sygoing.link/link/5758647-complexity-theory</link>
    <description>Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.</description>
    <pubDate>Wed, 24 Jul 2024 21:11:26 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5758647</guid>
  </item>
    <item>
    <title>Parameterized Complexity</title>
    <link>https://e-sygoing.link/link/5758638-parameterized-complexity</link>
    <description>Brief description, list of workers and problem compendium, compiled by Todd Wareham.</description>
    <pubDate>Thu, 23 May 2024 23:50:41 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5758638</guid>
  </item>
  </channel>
</rss>
