Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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
Document Date: 2010-09-03 07:57:16
Open Document
File Size: 272,81 KB
Share Result on Facebook
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