Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

Algorithms, Problems, Empirical Studies (APES)

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || Library Help
_____________________________________

Visit this site: http://www.cs.strath.ac.uk/~apes/
Author:Leeds and Strathclyde Universities, U.K.
Description: An informal group of researchers interested in the understanding of algorithms and problems through empirical studies. Brian Hayes' article Can't Get No Satisfaction, introduces phase transition research in satisfiability, outlining a problem near the root of theoretical computer science called the satisfiability problem (SAT), the first member of the class known as NP- complete problems: computational tasks that seem intrinsically hard, but that no one has yet proved are necessarily difficult. This site offers online papers and reports; public domain software; research links, and a bibliography.
Levels: College, Research
Languages: English
Resource Types: Problems/Puzzles, Articles, Bibliographies, General Software Miscellaneous
Math Topics: Operations Research, Artificial Intelligence

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.