Shopping Cart
You're getting the VIP treatment!
With the purchase of Kobo VIP Membership, you're getting 10% off and 2x Kobo Super Points on eligible items.
itemsitem
$14.95
An Introduction to Mathematical Modeling
Dover Books on Computer Science
Employing a practical, "learn by doing" approach, this 1st-rate text fosters the development of the skills beyond pure mathematics needed to set up and manipulate mathematical models. From a diversity of fields — including science, engineering, and operations research — come over 100 reality-based examples. 1978 edition. Includes 27 black-and-white figures.$22.95
Foundations of Combinatorics with Applications
This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics.The four-part treatment begins with a section on counting and listing that covers basic counting, functions, decision trees, and sieving methods. The following section addresses$15.95
A Short Course in Discrete Mathematics
Dover Books on Computer Science
What sort of mathematics do I need for computer science? In response to this frequently asked question, a pair of professors at the University of California at San Diego created this text. Its sources are two of the university's most basic courses: Discrete Mathematics, and Mathematics for Algorithm and System Analysis. Intended for use by sophomores in the first of a two-quarter sequence, the$22.99
Foundations of Combinatorics with Applications
This introduction to combinatorics is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics. Covers basic counting, functions, decision trees, and sieving methods; fundamental concepts in graph theory and a sampler of graph topics; induction and recursion, sorting theory, and rooted plane trees. Numerous exercises (some with solutions), notes, and$15.95
A Short Course in Discrete Mathematics
Dover Books on Computer Science
What sort of mathematics do I need for computer science? In response to this frequently asked question, a pair of professors at the University of California at San Diego created this text. Its sources are two of the university's most basic courses: Discrete Mathematics, and Mathematics for Algorithm and System Analysis. Intended for use by sophomores in the first of a two-quarter sequence, the$14.95
An Introduction to Mathematical Modeling
Dover Books on Computer Science
Employing a practical, "learn by doing" approach, this first-rate text fosters the development of the skills beyond the pure mathematics needed to set up and manipulate mathematical models. The author draws on a diversity of fields — including science, engineering, and operations research — to provide over 100 reality-based examples. Students learn from the examples by applying mathematical$21.59
Discrete Mathematics DeMYSTiFied
MULTIPLY your chances of understanding DISCRETE MATHEMATICSIf you're interested in learning the fundamentals of discrete mathematics but can't seem to get your brain to function, then here's your solution. Add this easy-to-follow guide to the equation and calculate how quickly you learn the essential concepts. Written by award-winning math professor Steven Krantz, Discrete Mathematics Demystified$53.99
Fundamentals of Discrete Math for Computer Science
Undergraduate Topics in Computer Science
This textbook provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Clearly structured and interactive in nature, the$31.99
Discrete Mathematics and Its Applications
Facts101 is your complete guide to Discrete Mathematics and Its Applications. In this book, you will learn topics such as The Fundamentals: Algorithms, the Integers, and Matrices, Induction and Recursion, Counting, and Discrete Probability plus much more. With key features such as key terms, people and places, Facts101 gives you all the information you need to prepare for your next exam. Our$65.69
Computability, Complexity, and Languages
Fundamentals of Theoretical Computer Science
Computer Science and Scientific Computing
This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.* Computability theory is introduced in a manner that makes maximum use of previous programming