Extremal Colorings and Extremal Satisfiability

By Philipp Zumstein

Combinatorial problems are often easy to state and hard to solve. A whole bunch of graph coloring problems falls into this class as well as the satisfiability problem. The classical coloring problems... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 3838114116
• ISBN13: 9783838114118
• Release Date: March 2010
• Publisher: Sudwestdeutscher Verlag Fur Hochschulschrifte
• Length: 140 Pages
• Weight: 0.47 lbs.
• Dimensions: 0.3" x 6.0" x 9.0"