Changes of Mathematical State [PDF document]
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Ivars Peterson - Science News Online|
|A discussion of constraint-satisfaction problems, more specifically the logic puzzle in theoretical computer science known as the satisfiability (SAT) problem (e.g. working out a seating plan), the current state of research on computational "phase transitions," and the use of transition phenomena in problems of computational complexity; where computational problems change rapidly from soluble to insoluble (e.g. search problems).|
|Levels:||High School (9-12), College|
|Math Topics:||Permutations/Combinations, Logic/Foundations, Operations Research, Artificial Intelligence|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.