Your shopping cart is empty!
Business & Management
- Accounting & Finance
- Business & Society
- Business Ethics
- Business Self-Help
- Business Statistics & Maths
- Business Technology
- Carreer Development
- Finance & Investment
- General & Introductory Business Management
- Intellectual Property & licensing
- Marketing & Sales
- Production Operations Management
- Project Management
- Property & Real Estate
- Public Administration & Management
- Quality Management
- Small Business
- Computer Science & Information Technology
- Language & linguistics
Medicine & Health Sciences
- Anesthesia, intensive care, pain management
- Clinical Medicine
- Emergency medicine
- Epidemiology, public health and medical statistics
- Geriatric medicine
- Infectious disease
- Internal medicine
- Medical imaging
- Medical law, ethics and forensic medicine
- Medicine: general interest
- Mental health, psychiatry and clinical psychology
- Neurology and clinical neuroscience
- Obstetrics and gynecology, reproductive medicine
- Pathology and laboratory science
- Pediatrics and child health
- Respiratory medicine
- Personal Development
- Science and engineering
- Social sciences
Algorithmics, complexity, computer algebra and computational geometry
This is the first book in which noisy information is studied in the context of computational complexity, in other words it deals with the computational complexity of mathematical problems for which available information is partial, noisy and priced. The author develops a general theory of computatio..
This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourabilit..
For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysi..
Indispensable for students, invaluable for researchers, this comprehensive treatment of contemporary quasiMonte Carlo methods, digital nets and sequences, and discrepancy theory starts from scratch with detailed explanations of the basic concepts and then advances to current methods used in researc..
Information retrieval, IR, the science of extracting information from any potential source, can be viewed in a number of ways: logical, probabilistic and vector space models are some of the most important. In this book, the author, one of the leading researchers in the area, shows how these views ca..
There has been an explosive growth in the field of combinatorial algorithms. These algorithms depend not only on results in combinatorics and especially in graph theory, but also on the development of new data structures and new techniques for analyzing algorithms. Four classical problems in network..
To perform computer simulation successfully, two rather different sets of skills are required. One of these relates to programming: a simulation program should do what its author intends and do it efficiently. The other is concerned with the collection and analysis of data: statistical tools have to..
This textbook, for second- or third-year students of computer science, presents insights, notations, and analogies to help them describe and think about algorithms like an expert, without grinding through lots of formal proof. Solutions to many problems are provided to let students check their progr..
Communication Complexity surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The..
First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their member..
In the last few years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. Algorithmic Game Theory develops the central ideas and results of this new and exciting area in a clear and succinct manner. More than 40 of the top researchers ..
By the time students have done some programming in one or two languages and have learnt the common ways of representing information in a computer, they will want to embark upon further study of theoretical or applied topics in computer science. Most will encounter problems that require for their sol..
Showing 1 to 12 of 56 (5 Pages)