For a long time computer scientists have distinguished between fast and slow algorithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad)....

The newly revised Second Edtion of this distinctive text uniquely blends interesting problems with strategies, tools, and techniques to develop mathematical skill and intuition necessary for problem solving. Readers are encouraged to do math rather than just study it. The author draws upon his experience as a coach for the International...

After introducing all of the necessary fundamentals of algebraic systems, the book presents...

With the advent of digital computers more than half a century ago, researchers working in a wide range of scientific disciplines have obtained an extremely powerful tool to pursue deep understanding of natural processes in physical, chemical, and biological systems. Computers pose a great challenge to mathematical sciences, as the range of...

The 28 revised full papers and 10 revised poster papers presented were carefully reviewed and selected from 117 initial submissions. The papers are organized in topical...

Solving puzzles demands a mindset that starts with a vulnerable openness followed by a rigorous drive to find a solution. Whether you're preparing for a programming job interview or just like a challenge, this book takes you on a tour of problem-solving techniques so you can dramatically improve your skills. You'll learn how to conquer simple...

Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the...

The 63 revised full...