Resolution proofs of matching principles

From MaRDI portal

Publication:1861903

Jump to:navigation, search

DOI10.1023/A:1021231610627zbMath1010.68165OpenAlexW1568798323MaRDI QIDQ1861903

Alasdair Urquhart

Publication date: 10 March 2003

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021231610627

zbMATH Keywords

complexity of proofs resolution method matchings in bipartite graphs pigeon-hole principle

Mathematics Subject Classification ID

Related Items (4)

Resolution lower bounds for perfect matching principles ⋮ Mutilated chessboard problem is exponentially hard for resolution ⋮ Unnamed Item ⋮ A Logical Autobiography

This page was built for publication: Resolution proofs of matching principles

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1861903&oldid=14256252"