@article{76b2c48289f44a87aac1f60df9479866,
title = "Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits",
keywords = "Boolean circuits, cut rule, DPLL, proof complexity, satisfiability, Boolean circuits, cut rule, DPLL, proof complexity, satisfiability, Boolean circuits, cut rule, DPLL, proof complexity, satisfiability",
author = "Matti J{\"a}rvisalo and Tommi Junttila and Ilkka Niemel{\"a}",
year = "2005",
doi = "10.1007/s10472-005-7034-1",
language = "English",
volume = "44",
pages = "373--399",
journal = "Annals of Mathematics and Artificial Intelligence",
issn = "1012-2443",
publisher = "Springer",
number = "4",
}