@inproceedings{f29d7435fb1d46cdab3f792701c1ef7f,
title = "Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits",
keywords = "Boolean circuits, proof complexity, satisfiability, tableau method, Boolean circuits, proof complexity, satisfiability, tableau method, Boolean circuits, proof complexity, satisfiability, tableau method",
author = "Matti J{\"a}rvisalo and Tommi Junttila and Ilkka Niemel{\"a}",
year = "2004",
language = "English",
booktitle = "Eighth International Symposium on Artificial Intelligence and Mathematics, Ft. Lauderdale, Florida, USA, 4.-6.1.2004",
}