Our search has the following Google-type functionality:

If you use '+' at the start of a word, that word will be present in the search results.

*eg. Harry +Potter*

*Search results will contain 'Potter'.*

If you use '-' at the start of a word, that word will be absent in the search results.

*eg. Harry -Potter*

*Search results will not contain 'Potter'.*

If you use 'AND' between 2 words, then both those words will be present in the search results.

*eg. Harry AND Potter*

*Search results will contain both 'Harry' and 'Potter'.*

NOTE: AND will only work with single words not phrases.

If you use 'OR' between 2 single words, then either or both of those words will be present in the search results.

*eg. 'Harry OR Potter'*

*Search results will contain just 'Harry', or just 'Potter', or both 'Harry' and 'Potter'.*

NOTE: OR will only work with single words not phrases.

If you use 'NOT' before a word, that word will be absent in the search results. (This is the same as using the minus symbol).

*eg. 'Harry NOT Potter'*

*Search results will not contain 'Potter'.*

NOTE: NOT will only work with single words not phrases.

If you use double quotation marks around words, those words will be present in that order.

*eg. "Harry Potter"*

*Search results will contain 'Harry Potter', but not 'Potter Harry'.*

NOTE: "" cannot be combined with AND, OR & NOT searches.

If you use '*' in a word, it performs a wildcard search, as it signifies any number of characters. (Searches cannot start with a wildcard).

*eg. 'Pot*er'*

*Search results will contain words starting with 'Pot' and ending in 'er', such as 'Potter'.*

- Sort Results By

Introduction to theory, proof techniques, and related concepts covers propositional logic, quantifiers, sets, functions, relations,... [more]

Combinatorics is a large branch of mathematics involving the counting, selecting, and arranging of objects. Robin Wilson explores... [more]

This book introduces prime numbers and explains the celebrated, unsolved Riemann hypothesis in a direct manner. Suitable for... [more]

A more intuitive approach to the mathematical foundation of computer science Discrete mathematics is the basis of much... [more]

Volume of geometric objects was studied by ancient Greek mathematicians. In discrete geometry, a relatively new branch of... [more]

DISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, Metric Edition explains complex, abstract concepts with clarity and precision... [more]

Automata and Computability is a class-tested textbook which provides a comprehensive and accessible introduction to the theory... [more]

Discrete Mathematics with Ducks, Second Edition is a gentle introduction for students who find the proofs and abstractions... [more]

Discrete Mathematics has permeated the whole of mathematics so much so it has now come to be taught even at the high school... [more]

A comprehensive work in finite-value systems that covers the latest achievements using the semi-tensor product method, on... [more]

Balances modern applications, pedagogy, and the technology to provide students the context they need to stay motivated in... [more]

Integrates the use of spreadsheets and graphing calculators with instructions for Microsoft Excel and the TI-83. This book... [more]

The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms,... [more]

Serious mathematics treated with levity. [more]

A concise yet rigorous introduction to logic and discrete mathematics. [more]

This new edition made the textbook the first discrete mathematics textbook to be revised in order to meet the proposed new... [more]

Discover the Connections between Different Structures and Fields Discrete Structures and Their Interactions highlights... [more]

Applicable to any problem that requires a finite number of solutions, finite state-based models (also called finite state... [more]

Enables readers to prove hundreds of mathematical results. This title presents the formal development of natural numbers from... [more]

Presents methods for solving counting problems and other types of problems that involve discrete structures. This work illustrates... [more]

Offers an exposition of discrete mathematics, including the core mathematical foundation of computer science. This book includes... [more]

Proofs play a central role in advanced mathematics and theoretical computer science, and this bestselling text's third edition... [more]

Stability, Control and Application of Time-Delay Systems gives a systematic description of these systems. It includes adequate... [more]

The Student Solutions Manual contains fully worked-out solutions to all of the exercises not completely answered in Appendix... [more]

This book contains fundamental concepts on discrete mathematical structures in an easy to understand style so that the reader... [more]