Note to users. If you're seeing this message, it means that your browser cannot find this page's style/presentation instructions -- or possibly that you are using a browser that does not support current Web standards. Find out more about why this message is appearing, and what you can do to make your experience of our site the best it can be.
IBC-DDT

Site Tools

  • AAAS
  • Subscribe
  • Feedback

Site Search

Search Advanced

Science 2 August 2002:
Vol. 297. no. 5582, pp. 784 - 785
DOI: 10.1126/science.1074599
Prev | Table of Contents | Next

Perspectives

COMPUTER SCIENCE:
Satisfied with Physics

Carla P. Gomes and Bart Selman

Satisfiability problems are logical reasoning problems that play an important role in the search for more efficient ways of solving large-scale computational problems. In their Perspective, Gomes and Selman highlight the report by Mézard et al., who borrow a method from statistical physics to characterize the search space that contains the solutions to such problems. The new approach also helps to find solutions in cases where conventional search methods fail.

The authors are in the Department of Computer Science, Cornell University, Ithaca, NY 14853, USA. E-mail: gomes{at}cs.cornell.edu, selman{at}cs.cornell.edu

Read the Full Text

ADVERTISEMENT
Click Me!

ADVERTISEMENT
Click Me!

To Advertise     Find Products

Science. ISSN 0036-8075 (print), 1095-9203 (online)