<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="../assets/xml/rss.xsl" media="all"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Bounded Rationality (Posts about verification)</title><link>http://bjlkeng.github.io/</link><description></description><atom:link href="http://bjlkeng.github.io/categories/verification.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><lastBuildDate>Tue, 28 Jul 2026 02:38:04 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Accessible Satisfiability</title><link>http://bjlkeng.github.io/posts/accessible-satisfiability/</link><dc:creator>Brian Keng</dc:creator><description>&lt;div&gt;&lt;p&gt;Even though it was just a scant few years ago, my research in grad school seems
like it was from another lifetime.  Nowadays I deal with data and most of my
code revolves around manipulating and extracting interesting insights from it.
However in my previous life I spent quite a bit of time dealing with
satisfiability problems.  So before I start writing about data and related
topics, I thought I'd kick it old school and write about some topics from my
formative years.&lt;/p&gt;
&lt;p&gt;&lt;a href="http://bjlkeng.github.io/posts/accessible-satisfiability/"&gt;Read more…&lt;/a&gt; (17 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><category>Boolean</category><category>formal</category><category>mathjax</category><category>NP-Complete</category><category>SAT</category><category>verification</category><guid>http://bjlkeng.github.io/posts/accessible-satisfiability/</guid><pubDate>Sun, 04 Oct 2015 00:28:04 GMT</pubDate></item></channel></rss>