<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Secrets on jakub opršal</title>
    <link>https://jakub-oprsal.vercel.app/secret/</link>
    <description>Recent content in Secrets on jakub opršal</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-gb</language>
    <lastBuildDate>Wed, 12 Aug 2026 09:00:00 +0200</lastBuildDate>
    
	<atom:link href="https://jakub-oprsal.vercel.app/secret/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>tutorial notes</title>
      <link>https://jakub-oprsal.vercel.app/secret/esslli/</link>
      <pubDate>Wed, 12 Aug 2026 09:00:00 +0200</pubDate>
      
      <guid>https://jakub-oprsal.vercel.app/secret/esslli/</guid>
      <description>Algebraic approach to constraint satisfaction link to slides
 main theorem If there is a natural transformation $\operatorname{pol}(A) \to \operatorname{pol}(B)$ then $\operatorname{CSP}(B)$ reduces to $\operatorname{CSP}(A)$ in logspace.  I recommend these two papers as an entry point into the theory. The first is recommended to anyone who knows what a functor is, and provides a categorical treatment of the above theorem. The second is more tradional. It was written for combinatorists, and provides a good overview of the state-of-the-art of the field just before the resolution of the dichotomy conjecture.</description>
    </item>
    
  </channel>
</rss>