This textbook details the variety of number formats used by computers, thereby helping to ground readers in what can and cannot be represented accurately, especially by floating-point numbers.The book...Lasīt vairāk
This textbook introduces the fundamental concepts and techniques used in biometric recognition to students, practitioners, and non-experts in the field. Specifically, the book describes key methodologies used for sensing, feature extraction, and m...Lasīt vairāk
This textbook aims to help the reader develop an in-depth understanding of logical reasoning and gain knowledge of the theory of computation. The book combines theoretical teaching and practical exercises; the latter is realised i...Lasīt vairāk
Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, such as approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted in...Lasīt vairāk
This textbook aims to help the reader develop an in-depth understanding of logical reasoning and gain knowledge of the theory of computation. The book combines theoretical teaching and practical exercises; the latter is realised i...Lasīt vairāk
Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, such as approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted in...Lasīt vairāk
My absolute favorite for this kind of interview preparation is Steven Skienas The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace graph problems are -- they should be part of every w...Lasīt vairāk
My absolute favorite for this kind of interview preparation is Steven Skienas The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace graph problems are -- they should be part of every w...Lasīt vairāk
This practically-focused study guide introduces the fundamentals of discrete mathematics through an extensive set of classroom-tested problems. Each chapter presents a concise introduction to the relevant theory, followed by a detailed account of...Lasīt vairāk
Written by two experts in the field, this is the only comprehensive and unified treatment of the central ideas and applications of Kolmogorov complexity. The book presents a thorough treatment of the subject with a wide range of illustrative appli...Lasīt vairāk
Šī grāmata vairs netiek publicēta. Jums tiks paziņota lietotas grāmatas cena
This practically-oriented textbook presents an accessible introduction to discrete mathematics through a substantial collection of classroom-tested exercises. Each chapter opens with concise coverage of the theory underlying the topic, reviewing t...Lasīt vairāk
This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, and approximation algorithms and heuristics for such probl...Lasīt vairāk
This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, and approximation algorithms and heuristics for such probl...Lasīt vairāk
This practically-oriented textbook presents an accessible introduction to discrete mathematics through a substantial collection of classroom-tested exercises. Each chapter opens with concise coverage of the theory underlying the topic, reviewing t...Lasīt vairāk
Šī grāmata vairs netiek publicēta. Jums tiks paziņota lietotas grāmatas cena
This stimulating textbook presents a broad and accessible guide to the fundamentals of discrete mathematics, highlighting how the techniques may be applied to various exciting areas in computing. The text is designed to motivate and inspire the reade...Lasīt vairāk
This text covers the state of the art in multivariate algorithmics and complexity, a vital field with countless applications in modern computing. It describes the latest methods of proving parameterized tractability, including powerful lower-bound...Lasīt vairāk
(Izdošanas datums: 25-Nov-2014, Paperback / softback, Izdevniecība: Springer-Verlag New York Inc., ISBN-13: 9781489984456)
The book is outstanding and admirable in many respects. ... is necessary reading for all kinds of readers from undergraduate students to top authorities in the field. Journal of Symbolic LogicWritten by two experts in the field, this is t...Lasīt vairāk
(Izdošanas datums: 03-Mar-2014, Paperback / softback, Izdevniecība: Springer-Verlag New York Inc., ISBN-13: 9781489989710)
This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key m...Lasīt vairāk
(Izdošanas datums: 17-Dec-2013, Hardback, Izdevniecība: Springer London Ltd, ISBN-13: 9781447155584)
This text covers the state of the art in multivariate algorithmics and complexity, a vital field with countless applications in modern computing. It describes the latest methods of proving parameterized tractability, including powerful lower-bound...Lasīt vairāk
This book explores one of the most common approaches to program verification, known as the assertional approach. Case studies supplied throughout the book demonstrate the use of the proof systems and formally verify solutions to classical problems...Lasīt vairāk
