Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution

Stefan S. Dantchev, Barnaby Martin, Stefan Szeider. Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. Electronic Colloquium on Computational Complexity (ECCC), 14(001), 2007. [doi]

Abstract

Abstract is missing.