Satisfiability, Branch-Width and Tseitin Tautologies

Michael Alekhnovich, Alexander A. Razborov. Satisfiability, Branch-Width and Tseitin Tautologies. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings. pages 593-603, IEEE Computer Society, 2002. [doi]

Authors

Michael Alekhnovich

This author has not been identified. Look up 'Michael Alekhnovich' in Google

Alexander A. Razborov

This author has not been identified. Look up 'Alexander A. Razborov' in Google