<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Shlomo Hoory | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/shlomo-hoory/</link><atom:link href="https://ac.tuwien.ac.at/team/shlomo-hoory/index.xml" rel="self" type="application/rss+xml"/><description>Shlomo Hoory</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sun, 01 Jan 2006 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Shlomo Hoory</title><link>https://ac.tuwien.ac.at/team/shlomo-hoory/</link></image><item><title>A note on unsatisfiable k-CNF formulas with few occurrences per variable</title><link>https://ac.tuwien.ac.at/publication/a-note-on-unsatisfiable-k-cnf-formulas-with-few-occurrences-per-variable/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-note-on-unsatisfiable-k-cnf-formulas-with-few-occurrences-per-variable/</guid><description/></item><item><title>Computing unsatisfiable k-SAT instances with few occurrences per variable</title><link>https://ac.tuwien.ac.at/publication/computing-unsatisfiable-k-sat-instances-with-few-occurrences-per-variable-2/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/computing-unsatisfiable-k-sat-instances-with-few-occurrences-per-variable-2/</guid><description/></item><item><title>Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable</title><link>https://ac.tuwien.ac.at/publication/computing-unsatisfiable-k-sat-instances-with-few-occurrences-per-variable/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/computing-unsatisfiable-k-sat-instances-with-few-occurrences-per-variable/</guid><description/></item></channel></rss>