Changes of Mathematical State [PDF document]
Library Home 
Full Table of Contents 
Suggest a Link 
Library Help
http://www.sciencenews.org/pages/pdfs/data/2000/15719/1571912.pdf  


Ivars Peterson  Science News Online  
A discussion of constraintsatisfaction 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 (912), College 
Languages:  English 
Resource Types:  Articles 
Math Topics:  Permutations/Combinations, Logic/Foundations, Operations Research, Artificial Intelligence 
[Privacy Policy] [Terms of Use]
© 1994 The Math Forum at NCTM. All rights reserved.
http://mathforum.org/