Parameterized proof complexity
type: Item
instance of: scholarly article
title: Parameterized proof complexity
zbMATH Open document ID: 1252.68151
author: Barnaby Martin
author: Stefan Szeider
author: Stephan Stoyanov Danchev
published in: Computational Complexity
publication date: 2012-09-21T00:00:00Z
full work available at URL: 4961.pdf
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03F20
zbMATH DE Number: 6085140
zbMATH Keywords: propositional proof complexity
zbMATH Keywords: parameterized complexity
zbMATH Keywords: complexity gap theorems
MaRDI profile type: Publication
OpenAlex ID: W2112145019
cites work: Q4218929
cites work: The Turing way to parameterized complexity
cites work: Improved Parameterized Upper Bounds for Vertex Cover
cites work: The relative efficiency of propositional proof systems
cites work: Q4503944
cites work: Which problems have strongly exponential complexity?
cites work: Q4856172
cites work: Q5710169
cites work: Proofs as Games
cites work: A complexity gap for tree resolution
DOI: 10.1007/S00037-010-0001-1
description: scientific article; zbMATH DE number 6085140