PARAMETERIZED PROOF COMPLEXITY Stefan Dantchev, Barnaby Martin, and Stefan Szeider Abstract. We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractabl

First Page		Document Content
Date: 2010-09-03 07:57:16		PARAMETERIZED PROOF COMPLEXITY Stefan Dantchev, Barnaby Martin, and Stefan Szeider Abstract. We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractabl Add to Reading List Source URL: www.bedewell.com Download Document from Source Website File Size: 272,81 KB Share Document on Facebook