TCS / Research / Publications / Strategies for Solving SAT in Grids by Randomized Search
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Strategies for Solving SAT in Grids by Randomized Search

Reference:

Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Strategies for solving SAT in grids by randomized search. In Serge Autexier, John Campbell, Julio Rubio, Volker Sorge, Masakazu Suzuki, and Freek Wiedijk, editors, Intelligent Computer Mathematics (AISC/Calculemus/MKM 2008), volume 5144 of Lecture Notes in Computer Science, pages 125–140. Springer, 2008.

Suggested BibTeX entry:

@inproceedings{HyvarinenJunttilaNiemela:AISC2008,
    author = {Antti E. J. Hyv\"arinen and Tommi Junttila and Ilkka Niemel\"a},
    booktitle = {Intelligent Computer Mathematics (AISC/Calculemus/MKM 2008)},
    editor = {Serge Autexier and John Campbell and Julio Rubio and Volker Sorge and Masakazu Suzuki and Freek Wiedijk},
    pages = {125--140},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Strategies for Solving {SAT} in Grids by Randomized Search},
    volume = {5144},
    year = {2008},
}

This work is not available online here.

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