Showing results for "michael fellows"
Showing 1 - 4 of 4 Results
Adult content is visible.
2015
EN
Accessible
When a blizzard traps a family outside in a whiteout, a cattle dog devises a stunning rescue in a moving, suspenseful, and gorgeously illustrated story.A family—a mother, a father, and their ten-year-old son—have come all the way from Florida to the Appalachian foothills to experience the wonder of a snowy weekend. At a nearby farm, a cattle dog is working, as she does every day, driving her forty head of cattle from pasture to corral and back again. And then, sudd...
2013
EN
This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizon. The text describes how the multivariate framework allows an extended dialog with a problem, enabling the reader who masters the complexity issues under discussion to use the positive and negativ...
- Narrated by
- Amanda Fellows
Unabridged
13 hours 21 min
2016
EN
The Crestfallen Rose merges the journey of a child born blind with that of two women whose lives are devastated in pre–World War II Germany into an exciting tale of love and death.Samantha Talbot is born blind. Her mother, Ally, searches for the cause and finds a mysterious link to a pesticide and to Worldwide Chemical. No lawyer will touch her case, until a former district attorney, David King, agrees to fight for her and Sam.Decades before Samantha’s birth, Amali...
Occupation: Spy
Eight Full-Cast BBC Radio Spy Thrillers
Unabridged
17 hours 42 min
2024
EN
A collection of full-cast dramatisations and original radio plays from master storyteller Ted Allbeury – plus bonus programmesDescribed by Len Deighton as ‘a classic writer of espionage fiction’, Ted Allbeury based his many acclaimed spy novels on his own real-life experiences. In World War II, he served as an intelligence officer with Special Operations Executive, and subsequently ran agents across the border between East and West Germany during the Cold War. He b...
People who read this also enjoyed
Fundamentals of Discrete Math for Computer Science
A Problem-Solving Primer
2012
EN
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 book presents detailed walkthroughs of several algorithms, stimulating a conversation wi...
Art of Computer Programming, Volume 2
Seminumerical Algorithms, Volume 2
2014
EN
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.–Byte, September 1995I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.–Charles LongIf you think y...
P, NP, and NP-Completeness
The Basics of Computational Complexity
2010
EN
The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive...
2012
EN
From the reviews of the previous editions".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at ...
- Book 1 -
- Tiger Days
2016
EN
Accessible
Meet animal lover, Tiger Days! A brand-new young fiction series about animals, friendship and adventure by bestselling author Sarah Lean.Beautiful black-and-white illustrations throughout.When nine-year-old Tiger Days stays with her grandmother at Willowgate House she never knows what might happen… new friends to meet, animals to rescue and problems to solve!Tiger’s grandmother looks after animals in need, and when Tiger comes to stay she quickly learns how to feed ...
2017
EN
Peter L. Montgomery has made significant contributions to computational number theory, introducing many basic tools such as Montgomery multiplication, Montgomery simultaneous inversion, Montgomery curves, and the Montgomery ladder. This book features state-of-the-art research in computational number theory related to Montgomery's work and its impact on computational efficiency and cryptography. Topics cover a wide range of topics such as Montgomery multiplication for both hardware and soft...
2009
EN
Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need t...
2011
EN
Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorit...











