<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Olaf Beyersdorff | AC Group | TU Wien</title><link>https://ac.notready.eu/author/olaf-beyersdorff/</link><atom:link href="https://ac.notready.eu/author/olaf-beyersdorff/index.xml" rel="self" type="application/rss+xml"/><description>Olaf Beyersdorff</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 01 Jan 2024 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Olaf Beyersdorff</title><link>https://ac.notready.eu/author/olaf-beyersdorff/</link></image><item><title>Hard QBFs for Merge Resolution</title><link>https://ac.notready.eu/publication/hard-qbfs-for-merge-resolution/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/hard-qbfs-for-merge-resolution/</guid><description/></item><item><title>QCDCL with cube learning or pure literal elimination - What is best?</title><link>https://ac.notready.eu/publication/qcdcl-with-cube-learning-or-pure-literal-elimination-what-is-best-2/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/qcdcl-with-cube-learning-or-pure-literal-elimination-what-is-best-2/</guid><description/></item><item><title>Should Decisions in QCDCL Follow Prefix Order?</title><link>https://ac.notready.eu/publication/should-decisions-in-qcdcl-follow-prefix-order-2/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/should-decisions-in-qcdcl-follow-prefix-order-2/</guid><description/></item><item><title>QCDCL with Cube Learning or Pure Literal Elimination - What is Best?</title><link>https://ac.notready.eu/publication/qcdcl-with-cube-learning-or-pure-literal-elimination-what-is-best/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/qcdcl-with-cube-learning-or-pure-literal-elimination-what-is-best/</guid><description/></item><item><title>Should Decisions in QCDCL Follow Prefix Order?</title><link>https://ac.notready.eu/publication/should-decisions-in-qcdcl-follow-prefix-order/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/should-decisions-in-qcdcl-follow-prefix-order/</guid><description/></item><item><title>Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths</title><link>https://ac.notready.eu/publication/strong-d-qbf-dependency-schemes-via-implication-free-resolution-paths/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/strong-d-qbf-dependency-schemes-via-implication-free-resolution-paths/</guid><description/></item><item><title>Hard QBFs for Merge Resolution</title><link>https://ac.notready.eu/publication/hard-qbfs-for-merge-resolution-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/hard-qbfs-for-merge-resolution-2/</guid><description/></item><item><title>Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths</title><link>https://ac.notready.eu/publication/strong-d-qbf-dependency-schemes-via-tautology-free-resolution-paths/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/strong-d-qbf-dependency-schemes-via-tautology-free-resolution-paths/</guid><description/></item></channel></rss>