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).
Search results will contain words starting with 'Pot' and ending in 'er', such as 'Potter'.
Graph theory goes back several centuries and revolves around the study of graphs--mathematical structures showing relations... [more]
Combinatorics is a large branch of mathematics involving the counting, selecting, and arranging of objects. Robin Wilson explores... [more]
Presented in 1962-63 by several experts at University College, London, these lectures include Extremal Problems in Graph... [more]
This book presents a wide-ranging variety of mathematical argument to give insights into the small world model, the preferential... [more]
The main idea of this approach is to start from relatively easy problems and step-by-step increase the level of difficulty... [more]
Concise but detailed and thorough treatment discusses rudiments of simplex method for solving optimization problems. Sufficient... [more]
Suitable for self-study or a first course in combinatorics at the undergraduate level, this title focuses on counting problems... [more]
Recent years have seen rapid progress in the field of approximate groups, with the emergence of a varied range of applications.... [more]
RC4 Stream Cipher and Its Variants is the first book to fully cover the popular software stream cipher RC4. With extensive... [more]
The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications... [more]
Combining analytic analysis of network reliability with the study of network combinatorial properties, this book develops... [more]
Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks... [more]
The advancement of large scale integrated circuit technology has enabled the construction of complex interconnection networks.... [more]
Presents an introduction to finite automata and semigroup theory and makes clear connections to other areas, including combinatorial... [more]
Near Rings, Fuzzy Ideals, and Graph Theory explores the relationship between near rings and fuzzy sets and between near rings... [more]
An effective blend of carefully explained theory and practical applications, this text imparts the fundamentals of both information... [more]
Combines elementary methods with analytic methods of modular functions to study the representation of integers as sums of... [more]
An update of the most accessible introductory number theory text available, this edition presents a mathematically rigorous... [more]
Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the... [more]
Finite Geometries stands out from recent textbooks about the subject of finite geometries by having a broader scope. The authors... [more]
The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and... [more]
Volume of geometric objects was studied by ancient Greek mathematicians. In discrete geometry, a relatively new branch of... [more]
The Art of Proving Binomial Identities accomplishes two goals: (1) It provides a unified treatment of the binomial coefficients,... [more]
Game Theory: A Modeling Approach quickly moves readers through the fundamental ideas of the subject to enable them to engage... [more]
The Mathematics of Chip-firing is a solid introduction and overview of the growing field of chip-firing. It offers an appreciation... [more]