<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Oliver Kullmann | AC Group | TU Wien</title><link>https://ac.notready.eu/author/oliver-kullmann/</link><atom:link href="https://ac.notready.eu/author/oliver-kullmann/index.xml" rel="self" type="application/rss+xml"/><description>Oliver Kullmann</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Tue, 01 Jan 2002 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Oliver Kullmann</title><link>https://ac.notready.eu/author/oliver-kullmann/</link></image><item><title>Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference</title><link>https://ac.notready.eu/publication/polynomial-time-recognition-of-minimal-unsatisfiable-formulas-with-fixed-clause-variable-difference/</link><pubDate>Tue, 01 Jan 2002 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/polynomial-time-recognition-of-minimal-unsatisfiable-formulas-with-fixed-clause-variable-difference/</guid><description/></item></channel></rss>