Proof Complexity of Cut-Based Tableaux for Boolean Circuit Satisfiability Checking

Reference:

Matti Järvisalo. Proof complexity of cut-based tableaux for Boolean circuit satisfiability checking. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2004.

Suggested BibTeX entry:

@mastersthesis{JarvisaloMsc,
    author = {Matti J{\"a}rvisalo},
    school = {Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science},
    title = {Proof Complexity of Cut-Based Tableaux for {B}oolean Circuit Satisfiability Checking},
    year = {2004},
}