TCS / Research / Publications / Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Reference:

Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence, 44(4):373–399, August 2005.

Suggested BibTeX entry:

@article{JarvisaloJunttilaNiemela:AMAI05,
    author = {Matti J{\"a}rvisalo and Tommi Junttila and Ilkka Niemel{\"a}},
    journal = {Annals of Mathematics and Artificial Intelligence},
    month = {August},
    number = {4},
    pages = {373--399},
    title = {Unrestricted vs Restricted Cut in a Tableau Method for {B}oolean Circuits},
    volume = {44},
    year = {2005},
}

See www.springerlink.com ...

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.