Proof Complexity and the Kneser-Lovász Theorem

DOI10.1007/978-3-319-09284-3_11zbMath1423.03243arXiv1402.4338OpenAlexW1754605724MaRDI QIDQ3192060

Adrian Crǎciun, Gabriel I. Istrate

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.4338

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Related Items (5)

Short Proofs of the Kneser-Lovász Coloring Principle ⋮ Short proofs of the Kneser-Lovász coloring principle ⋮ Propositional Proofs in Frege and Extended Frege Systems (Abstract) ⋮ A parametric worst-case approach to fairness in cooperative games with transferable utility ⋮ Quasipolynomial size proofs of the propositional pigeonhole principle

This page was built for publication: Proof Complexity and the Kneser-Lovász Theorem