Some Definitorial Suggestions for Parameterized Proof Complexity

DOI10.1007/978-3-642-33293-7_9zbMath1374.03061OpenAlexW74983657MaRDI QIDQ4899242

Moritz Müller, Jörg Flum

Publication date: 7 January 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_9

Mathematics Subject Classification ID

Complexity of proofs (03F20)

This page was built for publication: Some Definitorial Suggestions for Parameterized Proof Complexity