"Hedging Bets on Hard Problems", by Charles Seife, Science, vol. 275, p. 33, Jan. 3, 1997. |
"An Economics Approach to Hard Computational Problems", Benardo A. Huberman et al., Science, vol. 275, pp. 51-54, Jan. 3, 1997. |
Physical Mapping of Chromosomes "Physical Mapping of chromosomes Using Unique Probes" Faird Alizadeh et al., Chapter 54, pp. 489-500. |
"Random Competition: A Simple, but Efficient Method for Parallelizing Inference Systems", Wolfgang Ertel, Parallelization in Inference Systems, B. Fronhofer et al., Eds. pp. 195-207, 1992. |
"Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems", Steven Minton et al. Artificial Intelligence, vol. 58, pp. 161-205 (1992). |
"A New Method for Solving Hard Satisfiability Problems", Problem Solving: Constraint Satisfaction, Selman et al. pp. 440-446. |
"Phase transitions and the search problem", Hogg et al. Artificial Intelligence vol. 81, (1996), pp. 1-15. |
"Critical Behavior in the Satisfiability of Random Boolean Expressions," Scott Kirkpatrick et al. Science vol. 264, pp. 1297-1301 (May 27, 1994). |
"Expected Gains from Parallelizing Constraint Solving for Hard Problems" Tad Hogg et al., Proceedings of the 12.sup.th National Conference on Artificial Intelligence, pp. 331-336, 1994. |
"Cooperative Solution of Constraint Satisfaction Problems", Scott H. Clearwater et al., Science, vol. 254, pp. 1181-1183 (Nov. 22, 1991). |
"Go With the Winners" Algorithms, David Aldous et al., Proceedings of the 35th Symposium on the Foundations of Computer Science, 1994, pp. 492-501. |
"How to Use Expert Advice" Nicolo Cesa-Bianchi et al., Proceedings of the 25.sup.th Annual ACM Symposium on the Theory of Computing, (1993) pp. 382-391. |
"Solving the Really Hard Problems with Cooperative Search", Tad Hogg et al., Proceedings of the 11.sup.th National Conference on Artificial Intelligence, 1993, pp. 231-236. |
"A fast quantum mechnical algorithm for database search", by Lov K. Grover, Proceedings of the 28.sup.th Annual Symposium on the Theory of Computing, 1996, pp. 212-219. |