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. In 8th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, USA, January 4–6, 2004. Proceedings available at http://rutcor.rutgers.edu/%7Eamai/aimath04/.

Suggested BibTeX entry:

@inproceedings{JJN:AIMath04,
    author = {Matti J{\"a}rvisalo and Tommi Junttila and Ilkka Niemel{\"a}},
    booktitle = {8th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, USA, January 4--6},
    note = {Proceedings available at \url{http://rutcor.rutgers.edu/\%7Eamai/aimath04/}},
    title = {Unrestricted vs Restricted Cut in a Tableau Method for {B}oolean Circuits},
    year = {2004},
}

See www.tcs.hut.fi ...

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