Søgning på underkategorier- og emner:
The second edition of this bestselling book provides an overview of the key topics in undergraduate mathematics, allowing beginning graduate... Læs mere
To succeed in data science you need some math proficiency. But not just any math. This common-sense guide provides a clear, plain English survey of the math you'll need... Læs mere
This new edition of Modern Fortran Explained provides a clear and thorough description of the latest version of Fortran, written by experts in the field with the intention that it remain the main reference work in the field.
Edited by several of the leading figures in the field, this is the first book to provide a state-of-the-art, accessibly written methodological introduction to... Læs mere
Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software... Læs mere
This textbook offers clear, extensive coverage of all essential elements of the C++ programming language. Theoretical concepts are described from scratch and are... Læs mere
Now available in paperback, The Description Logic Handbook is the definitive reference and study guide for researchers in the field... Læs mere
Written for human-computer interaction (HCI) researchers - whether undergraduates, professors, or UX professionals who need to analyse quantitative... Læs mere
This book proposes a formal mathematical language, a distributed pi-calculus called Dpi, for describing, at varying levels of abstraction, the behaviour of mobile agents in a... Læs mere
This book provides an authoritative and multifaceted introduction to eight major approaches to computation on uncountable mathematical domains. The perspectives... Læs mere
This text for graduate students and researchers gives a complete coverage of the field with mathematical rigour, from basics to advanced... Læs mere
Aimed at researchers and graduate students in mathematics and theoretical computer science, who are interested in logical approaches to fundamental problems of computational complexity theory, and of proof complexity in particular.