Maths for computer scientists Books
Springer Fachmedien Wiesbaden Grundlagen der Rechnerarchitektur: Von der
Book Synopsis Das Buch führt in die Grundlagen der technischen Informatik ein und richtet sich generell an Studierende der MINT-Fächer in den ersten Semestern. Ausgehend von den mathematischen Grundlagen zur Beschreibung und Berechnung logischer Schaltungen wird der komplette Entwurf digitaler Rechenmaschinen beschrieben. Aufbauend auf der Halbleitertechnik und deren Schaltungen führt das Buch in die Grundbegriffe der Rechnerarchitektur anhand einfacher und selbst aufbaubarer Beispiele ein.Table of ContentsHistorische Entwicklung von Rechenmaschinen.-Zahlen und Arithmetik.-Mathematische Grundlagen digitaler Schaltungen.-Digitale Schaltungen.-Elemente der Rechnerarchitektur.-Rechnerarchitektur.
£28.49
Springer Mathematics for Computer Scientists: A
Book SynopsisThis textbook contains the mathematics needed to study computer science in application-oriented computer science courses. The content is based on the author's many years of teaching experience.The translation of the original German 7th edition Mathematik für Informatiker by Peter Hartmann was done with the help of artificial intelligence. A subsequent human revision was done primarily in terms of content.Textbook Features You will always find applications to computer science in this book. Not only will you learn mathematical methods, you will gain insights into the ways of mathematical thinking to form a foundation for understanding computer science. Proofs are given when they help you learn something, not for the sake of proving. Mathematics is initially a necessary evil for many students. The author explains in each lesson how students can apply what they have learned by giving many real world examples, and by constantly cross-referencing math and computer science. Students will see how math is not only useful, but can be interesting and sometimes fun.The Content Sets, logic, number theory, algebraic structures, cryptography, vector spaces, matrices, linear equations and mappings, eigenvalues, graph theory. Sequences and series, continuous functions, differential and integral calculus, differential equations, numerics. Probability theory and statistics. The Target AudiencesStudents in all computer science-related coursework, and independent learners.Table of ContentsDISCRETE MATHEMATICS AND LINEAR ALGEBRA.- Sets and mappings.- Logic.- Natural numbers, complete induction, recursion.- Some number theory.- Algebraic structures.- Vector spaces.- Matrices.- Gaussian algorithm and systems of linear equations.- Eigenvalues, eigenvectors and basis transformations.- Scalar product and orthogonal maps.- Graph theory.- ANALYSIS.- The real numbers.- Sequences and series.- Continuous functions.- Differential calculus.- Integral calculus.- Differential equations.- Numerical methods.- PROBABILITY AND STATISTICS.- Probability spaces.- Random variables.- Important distributions and stochastic processes.- Statistical methods.- Appendix.
£53.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Logic, Language, Information, and Computation: 21st International Workshop, WoLLIC 2014, Valparaíso, Chile, September 1-4, 2014. Proceedings
Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 21st Workshop on Logic, Language, Information and Communication, WoLLIC 2014, held in Valparaiso, Chile, in September 2014. The 15 contributed papers presented together with 6 invited lectures were carefully reviewed and selected from 29 submissions. The focus of the workshop was on the following subjects Inter-Disciplinary Research involving Formal Logic, Computing and Programming Theory, and Natural Language and Reasoning.
£39.99
Lannoo Publishers Multimedia Maths
Book Synopsis"In this revised edition of Multimedia Maths, Ivo De Pauw and Bieke Masselis cover screen related mathematical ideas, ranging from trigonometry to transformations and reveal beziers in an understandable fashion. It is a must have for every multimedia professional." Fries Carton - Guerrilla Games, Amsterdam. This basic maths textbook will guide the reader through several standard topics, such as vectors and parameters. In addition to exploring the golden section, Multimedia Maths offers surprising and reality-based insights into Bezier curves and B-splines. Screen effects and image handling are taken to a higher level via a detailed outline of all the basic transformations. The book is accompanied by a companion website. Visit www.multimediamaths.be for online support and useful downloads.
£28.00
World Scientific Publishing Co Pte Ltd Chinese Remainder Theorem: Applications In
Book SynopsisChinese Remainder Theorem, CRT, is one of the jewels of mathematics. It is a perfect combination of beauty and utility or, in the words of Horace, omne tulit punctum qui miscuit utile dulci. Known already for ages, CRT continues to present itself in new contexts and open vistas for new types of applications. So far, its usefulness has been obvious within the realm of “three C's”. Computing was its original field of application, and continues to be important as regards various aspects of algorithmics and modular computations. Theory of codes and cryptography are two more recent fields of application.This book tells about CRT, its background and philosophy, history, generalizations and, most importantly, its applications. The book is self-contained. This means that no factual knowledge is assumed on the part of the reader. We even provide brief tutorials on relevant subjects, algebra and information theory. However, some mathematical maturity is surely a prerequisite, as our presentation is at an advanced undergraduate or beginning graduate level. We have tried to make the exposition innovative, many of the individual results being new. We will return to this matter, as well as to the interdependence of the various parts of the book, at the end of the Introduction.A special course about CRT can be based on the book. The individual chapters are largely independent and, consequently, the book can be used as supplementary material for courses in algorithmics, coding theory, cryptography or theory of computing. Of course, the book is also a reference for matters dealing with CRT.Table of ContentsIntroduction and philosophy; Chinese remainder algorithm; in modular computations in algorithmics; in bridging computations; in coding theory; in cryptography; tutorial in information theory; tutorial in algebra; list of mathematical symbols.
£78.85
World Scientific Publishing Co Pte Ltd Mathematical Logic For Computer Science (2nd
Book SynopsisMathematical logic is essentially related to computer science. This book describes the aspects of mathematical logic that are closely related to each other, including classical logic, constructive logic, and modal logic. This book is intended to attend to both the peculiarities of logical systems and the requirements of computer science.In this edition, the revisions essentially involve rewriting the proofs, increasing the explanations, and adopting new terms and notations.Table of ContentsPart 1 Prerequisites: sets; inductive definitions and proofs; notations. Part 2 Classical propositional logic: propositions and connectives; propositional language; semantics; tautological consequence; formal deduction; disjunctive and conjunctive normal forms; adequate sets of connectives. Part 3 Classical first-order logic: proposition functions and quantifiers; first-order language; semantics; logical consequence; formal deduction; prenex normal form. Part 4 Axiomatic deduction system: axiomatic deduction system; relation between the two deduction systems. Part 5 Soundness and completeness: satisfiability and validity; soundness; completeness of propositional logic; completeness of first-order logic; completeness of first-order logic with equality; independence. Part 6 Compactness, Lowenheim-Skolem, and Herbrand theorems: compactness; Lowenheim-Skolem's theorem; Herbrand's theorem. Part 7 Constructive logic: constructivity of proofs; semantics; formal deduction; soundness; completeness. Part 8 Modal propositional logic: modal propositional language; semantics; formal deduction; soundness; completeness of T; completeness of S4, B, S5. Part 9 Modal first-order logic: modal first-order language; semantics; formal deduction; soundness; completeness; equality.
£65.55
World Scientific Publishing Co Pte Ltd Linear Algebra And Optimization With Applications
Book SynopsisThis book provides the mathematical fundamentals of linear algebra to practicers in computer vision, machine learning, robotics, applied mathematics, and electrical engineering. By only assuming a knowledge of calculus, the authors develop, in a rigorous yet down to earth manner, the mathematical theory behind concepts such as: vectors spaces, bases, linear maps, duality, Hermitian spaces, the spectral theorems, SVD, and the primary decomposition theorem. At all times, pertinent real-world applications are provided. This book includes the mathematical explanations for the tools used which we believe that is adequate for computer scientists, engineers and mathematicians who really want to do serious research and make significant contributions in their respective fields.
£162.00
World Scientific Publishing Co Pte Ltd Linear Algebra And Optimization With Applications
Book SynopsisThis book provides the mathematical fundamentals of linear algebra to practicers in computer vision, machine learning, robotics, applied mathematics, and electrical engineering. By only assuming a knowledge of calculus, the authors develop, in a rigorous yet down to earth manner, the mathematical theory behind concepts such as: vectors spaces, bases, linear maps, duality, Hermitian spaces, the spectral theorems, SVD, and the primary decomposition theorem. At all times, pertinent real-world applications are provided. This book includes the mathematical explanations for the tools used which we believe that is adequate for computer scientists, engineers and mathematicians who really want to do serious research and make significant contributions in their respective fields.
£81.00
World Scientific Publishing Co Pte Ltd Linear Algebra And Optimization With Applications
Book SynopsisVolume 2 applies the linear algebra concepts presented in Volume 1 to optimization problems which frequently occur throughout machine learning. This book blends theory with practice by not only carefully discussing the mathematical under pinnings of each optimization technique but by applying these techniques to linear programming, support vector machines (SVM), principal component analysis (PCA), and ridge regression. Volume 2 begins by discussing preliminary concepts of optimization theory such as metric spaces, derivatives, and the Lagrange multiplier technique for finding extrema of real valued functions. The focus then shifts to the special case of optimizing a linear function over a region determined by affine constraints, namely linear programming. Highlights include careful derivations and applications of the simplex algorithm, the dual-simplex algorithm, and the primal-dual algorithm. The theoretical heart of this book is the mathematically rigorous presentation of various nonlinear optimization methods, including but not limited to gradient decent, the Karush-Kuhn-Tucker (KKT) conditions, Lagrangian duality, alternating direction method of multipliers (ADMM), and the kernel method. These methods are carefully applied to hard margin SVM, soft margin SVM, kernel PCA, ridge regression, lasso regression, and elastic-net regression. Matlab programs implementing these methods are included.
£162.00
World Scientific Publishing Co Pte Ltd Fractional Discrete Chaos: Theories, Methods And
Book SynopsisIn the nineteenth-century, fractional calculus had its origin in extending differentiation and integration operators from the integer-order case to the fractional-order case. Discrete fractional calculus has recently become an important research topic, useful in various science and engineering applications. The first definition of the fractional-order discrete-time/difference operator was introduced in 1974 by Diaz and Osler, where such operator was derived by discretizing the fractional-order continuous-time operator. Successfully, several types of fractional-order difference operators have then been proposed and introduced through further generalizing numerous classical operators, motivating several researchers to publish extensively on a new class of systems, viz the nonlinear fractional-order discrete-time systems (or simply, the fractional-order maps), and their chaotic behaviors. This discovery of chaos in such maps, has led to novel control methods for effectively stabilizing their chaotic dynamics.The aims of this book are as follows:
£66.50
Springer Verlag, Singapore Monte Carlo Methods
Book SynopsisThis book seeks to bridge the gap between statistics and computer science. It provides an overview of Monte Carlo methods, including Sequential Monte Carlo, Markov Chain Monte Carlo, Metropolis-Hastings, Gibbs Sampler, Cluster Sampling, Data Driven MCMC, Stochastic Gradient descent, Langevin Monte Carlo, Hamiltonian Monte Carlo, and energy landscape mapping. Due to its comprehensive nature, the book is suitable for developing and teaching graduate courses on Monte Carlo methods. To facilitate learning, each chapter includes several representative application examples from various fields. The book pursues two main goals: (1) It introduces researchers to applying Monte Carlo methods to broader problems in areas such as Computer Vision, Computer Graphics, Machine Learning, Robotics, Artificial Intelligence, etc.; and (2) it makes it easier for scientists and engineers working in these areas to employ Monte Carlo methods to enhance their research.Trade Review“This monograph ... is intended to be a textbook for graduate students in statistics, computer science and engineering. It covers a very broad range of topics ... . Each chapter is finished by a rather long list of relevant references. Thus, it can be used also as a reference book by researches in the fields of machine learning, pattern recognition ... . it can be a useful reference to many important Monte Carol methods.” (Jaromír Antoch, zbMATH 1483.65001, 2022)“True to its goal, the text offers a comprehensive overview on Monte Carlo methods. … this text is a quality reference for researchers interested in computer vision, computer graphics, machine learning, artificial intelligence and related fields.” (Grant Innerst, MAA Reviews, July 18, 2021)Table of Contents1 Introduction to Monte Carlo Methods.- 2 Sequential Monte Carlo.- 3 Markov Chain Monte Carlo - the Basics.- 4 Metropolis Methods and Variants.- 5 Gibbs Sampler and its Variants.- 6 Cluster Sampling Methods.- 7 Convergence Analysis of MCMC.- 8 Data Driven Markov Chain Monte Carlo.- 9 Hamiltonian and Langevin Monte Carlo.- 10 Learning with Stochastic Gradient.- 11 Mapping the Energy Landscape.
£89.99
Springer Verlag, Singapore Statistical Learning with Math and Python: 100
Book SynopsisThe most crucial ability for machine learning and data science is mathematical logic for grasping their essence rather than knowledge and experience. This textbook approaches the essence of machine learning and data science by considering math problems and building Python programs. As the preliminary part, Chapter 1 provides a concise introduction to linear algebra, which will help novices read further to the following main chapters. Those succeeding chapters present essential topics in statistical learning: linear regression, classification, resampling, information criteria, regularization, nonlinear regression, decision trees, support vector machines, and unsupervised learning. Each chapter mathematically formulates and solves machine learning problems and builds the programs. The body of a chapter is accompanied by proofs and programs in an appendix, with exercises at the end of the chapter. Because the book is carefully organized to provide the solutions to the exercises in each chapter, readers can solve the total of 100 exercises by simply following the contents of each chapter. This textbook is suitable for an undergraduate or graduate course consisting of about 12 lectures. Written in an easy-to-follow and self-contained style, this book will also be perfect material for independent learning.Table of ContentsChapter 1: Linear Algebra.- Chapter 2: Linear Regression.- Chapter 3: Classification.- Chapter 4: Resampling.- Chapter 5: Information Criteria.- Chapter 6: Regularization.- Chapter 7: Nonlinear Regression.- Chapter 8: Decision Trees.- Chapter 9: Support Vector Machine.- Chapter 10: Unsupervised Learning.
£26.99
Springer Verlag, Singapore Linear Programming Computation
Book SynopsisThis monograph represents a historic breakthrough in the field of linear programming (LP)since George Dantzig first discovered the simplex method in 1947. Being both thoughtful and informative, it focuses on reflecting and promoting the state of the art by highlighting new achievements in LP. This new edition is organized in two volumes. The first volume addresses foundations of LP, including the geometry of feasible region, the simplex method and its implementation, duality and the dual simplex method, the primal-dual simplex method, sensitivity analysis and parametric LP, the generalized simplex method, the decomposition method, the interior-point method and integer LP method. The second volume mainly introduces contributions of the author himself, such as efficient primal/dual pivot rules, primal/dual Phase-I methods, reduced/D-reduced simplex methods, the generalized reduced simplex method, primal/dual deficient-basis methods, primal/dual face methods, a new decomposition principle, etc.Many important improvements were made in this edition. The first volume includes new results, such as the mixed two-phase simplex algorithm, dual elimination, fresh pricing scheme for reduced cost, bilevel LP models and intercepting of optimal solution set. In particular, the chapter Integer LP Method was rewritten with great gains of the objective cutting for new ILP solvers {\it controlled-cutting/branch} methods, as well as with an attractive implementation of the controlled-branch method. In the second volume, the `simplex feasible-point algorithm' was rewritten, and removed from the chapter Pivotal Interior-Point Method to form an independent chapter with the new title `Simplex Interior-Point Method', as it represents a class of efficient interior-point algorithms transformed from traditional simplex algorithms. The title of the original chapter was then changed to `Facial Interior-Point Method', as the remaining algorithms represent another class of efficient interior-point algorithms transformed from normal interior-point algorithms. Without exploiting sparsity, the original primal/dual face methods were implemented using Cholesky factorization. In order to deal with sparse computation, two new chapters discussing LU factorization were added to the second volume. The most exciting improvement came from the rediscovery of the reduced simplex method. In the first edition, the derivation of its prototype was presented in a chapter with the same title, and then converted into the so-called `improved' version in another chapter. Fortunately, the author recently found a quite concise new derivation, so he can now introduce the distinctive fresh simplex method in a single chapter. It is exciting that the reduced simplex method can be expected to be the best LP solver ever.With a focus on computation, the current edition contains many novel ideas, theories and methods, supported by solid numerical results. Being clear and succinct, its content reveals in a fresh manner, from simple to profound. In particular, a larger number of examples were worked out to demonstrate algorithms. This book is a rare work in LP and an indispensable tool for undergraduate and graduate students, teachers, practitioners, and researchers in LP and related fields.Table of ContentsChapter 1. Introduction.- Chapter 2. Geometry of Feasible Region.- Chapter 3. Simplex Method.- Chapter 4. Implementation of Simplex Method.- Chapter 5. Duality Principle and Dual Simplex Method.- Chapter 6. Primal-Dual Simplex Method.- Chapter 7. Sensitivity Analysis and Parametric LP.- Chapter 8. Generalized Simplex Method.- Chapter 9. Decomposition Method.- Chapter 10. Interior-Point Method.- Chapter 11. Integer Linear Programming (ILP).- Chapter 12. Pivot Rule.- Chapter 13. Dual Pivot Rule.- Chapter 14. Simplex Phase-I Method.- Chapter 15. Dual Simplex Phase-l Method.- Chapter 16. Reduced Simplex Method.- Chapter 17. D-Reduced Simplex Method.- Chapter 18. Generalized Reduced Simplex Method.- Chapter 19. Deficient-Basis Method.- Chapter 20. Dual Decient-Basis Method.- Chapter 21. Face Method with Cholesky Factorization.- Chapter 22. Dual Face Method with Cholesky Factorization.- Chapter 23. Face Method with LU Factorization.- Chapter 24. Dual Face Method with LU Factorization.- Chapter 25. Simplex Interior-Point Method.- Chapter 26. Facial Interior-Point Method.- Chapter 27. Decomposition Principle.
£189.99
World Scientific Publishing Co Pte Ltd Nonlinear Workbook, The: Chaos, Fractals,
Book SynopsisNew Edition: The Nonlinear Workbook (6th Edition)The study of nonlinear dynamical systems has advanced tremendously in the last 20 years, making a big impact on science and technology. This book provides all the techniques and methods used in nonlinear dynamics. The concepts and underlying mathematics are discussed in detail.The numerical and symbolic methods are implemented in C++, SymbolicC++ and Java. Object-oriented techniques are also applied. The book contains more than 150 ready-to-run programs.The text has also been designed for a one-year course at both the junior and senior levels in nonlinear dynamics. The topics discussed in the book are part of e-learning and distance learning courses conducted by the International School for Scientific Computing, University of Johannesburg.Table of ContentsNonlinear and Chaotic Maps; Time Series Analysis; Autonomous Systems in the Plane; Nonlinear Hamilton Systems; Nonlinear Dissipative Systems; Nonlinear Driven Systems; Controlling of Chaos; Synchronization of Chaos; Fractals; Cellular Automata; Solving Differential Equations; Neural Networks; Genetic Algorithms; Gene Expression Programming; Optimization; Discrete Wavelets; Discrete Hidden Markov Processes; Fuzzy Sets and Fuzzy Logic.
£64.60
World Scientific Publishing Co Pte Ltd Computer Algebra With Symbolicc++
Book SynopsisThis book gives a comprehensive introduction to computer algebra together with advanced topics in this field. It provides a detailed coverage of the mathematics of computer algebra as well as a step-by-step guide to implement a computer algebra system in the object-oriented language C++. The used tools from C++ are introduced in detail.Numerous examples from mathematics, physics and engineering are presented to illustrate the system's capabilities. Computer algebra implementations in LISP and Haskell are also included. In addition, gene expression programming and multiexpression programming with applications to computer algebra are introduced.Table of ContentsMathematics for Computer Algebra; Computer Algebra Systems; Tools in C++; String Class; Standard Template Library; Classes for Computer Algebra; Symbolic Class; Applications; LISP and Computer Algebra; Lisp Using C++; Gene Expression Programming; Program Listing.
£84.55
World Scientific Publishing Co Pte Ltd Problems With A Point: Exploring Math And
Book Synopsis'Points, questions, stories, and occasional rants introduce the 24 chapters of this engaging volume. With a focus on mathematics and peppered with a scattering of computer science settings, the entries range from lightly humorous to curiously thought-provoking. Each chapter includes sections and sub-sections that illustrate and supplement the point at hand. Most topics are self-contained within each chapter, and a solid high school mathematics background is all that is needed to enjoy the discussions. There certainly is much to enjoy here.'CHOICEEver notice how people sometimes use math words inaccurately? Or how sometimes you instinctively know a math statement is false (or not known)?Each chapter of this book makes a point like those above and then illustrates the point by doing some real mathematics through step-by-step mathematical techniques.This book gives readers valuable information about how mathematics and theoretical computer science work, while teaching them some actual mathematics and computer science through examples and exercises. Much of the mathematics could be understood by a bright high school student. The points made can be understood by anyone with an interest in math, from the bright high school student to a Field's medal winner.
£33.25
World Scientific Publishing Co Pte Ltd Introduction To The Analysis Of Algorithms, An
Book SynopsisThis textbook covers the mathematical foundations of the analysis of algorithms. The gist of the book is how to argue, without the burden of excessive formalism, that a given algorithm does what it is supposed to do. The two key ideas of the proof of correctness, induction and invariance, are employed in the framework of pre/post-conditions and loop invariants.The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide & Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are discussed. Randomized algorithms, which are now ubiquitous because of their applications to cryptography; and Online algorithms, which are essential in fields as diverse as operating systems (caching, in particular) and stock-market predictions.This self-contained book is intended for undergraduate students in computer science and mathematics.Table of ContentsPreliminaries; Greedy Algorithms; Divide and Conquer; Dynamic Programming; Randomized Algorithms; Online Algorithms.
£35.15
World Scientific Publishing Co Pte Ltd Theory Of Randomized Search Heuristics:
Book SynopsisRandomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last five years, also attempts to explain the success of the methods in practical applications.This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence. Each chapter provides an overview of a particular domain and gives insights into the proofs and proof techniques of more specialized areas. Open problems still remain widely in randomized search heuristics — being a relatively young and vast field. These problems and directions for future research are addressed and discussed in this book.The book will be an essential source of reference for experts in the domain of randomized search heuristics and also for researchers who are involved or ready to embark in this field. As an advanced textbook, graduate students will benefit from the comprehensive coverage of topicsTable of ContentsTail Inequalities (B Doerr); No-Free-Lunch Theorems (D Whitley); GA-Theory; Runtime Analyses of EAs, in particular, the Drift Analysis Method (P Oliveto et al.); EAs for Combinatorial Optimization Problems, in particular, Good Representations (D Johannsen); Ant Colony Optimization; Evolution Strategies: Lower Bounds and Complexity Analysis; Evolution Strategies: Theory of Markov Chains for Log-Linear Convergence (A Auger & N Hansen); Particle Swarm Optimization (C Witt); Probabilistic Model Building; Learning Classifiers.
£108.00
World Scientific Publishing Co Pte Ltd Computer Arithmetic - Volume Iii
Book SynopsisComputer Arithmetic Volume III is a compilation of key papers in computer arithmetic on floating-point arithmetic and design. The intent is to show progress, evolution, and novelty in the area of floating-point arithmetic. This field has made extraordinary progress since the initial software routines on mainframe computers have evolved into hardware implementations in processors spanning a wide range of performance. Nevertheless, these papers pave the way to the understanding of modern day processors design where computer arithmetic are supported by floating-point units. The goal of Volume III is to collect the defining document for floating-point arithmetic and many of the key papers on the implementation of both binary and decimal floating-point arithmetic into a single volume. Although fewer than forty papers are included, their reference lists will direct the interested reader to other excellent work that could not be included here.Volume III is specifically oriented to the needs of designers and users of both general-purpose computers and special-purpose digital processors. The book should also be useful to systems engineers, computer architects, and logic designers. It is also intended to serve as a primary text for a course on floating-point arithmetic, as well as a supplementary text for courses in digital arithmetic and high-speed signal processing.This volume is part of a 3 volume set:Computer Arithmetic Volume IComputer Arithmetic Volume IIComputer Arithmetic Volume IIIThe full set is available for sale in a print-only version.Table of ContentsIEEE 754-2008 Floating-Point Standard; Addition; Multiplication; Division; Rounding; Fused Multiply-Add; Elementary Functions; Decimal Floating-Point Arithmetic;
£135.00
World Scientific Publishing Co Pte Ltd Computer Arithmetic - Volume I
Book SynopsisThe book provides many of the basic papers in computer arithmetic. These papers describe the concepts and basic operations (in the words of the original developers) that would be useful to the designers of computers and embedded systems. Although the main focus is on the basic operations of addition, multiplication and division, advanced concepts such as logarithmic arithmetic and the calculations of elementary functions are also covered.This volume is part of a 3 volume set:Computer Arithmetic Volume IComputer Arithmetic Volume IIComputer Arithmetic Volume IIIThe full set is available for sale in a print-only version.
£115.20
Association of Computing Machinery,U.S. Logic, Automata, and Computational Complexity:
Book SynopsisProfessor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook won the 1982 Turing Award for "his advancement of our understanding of the complexity of computation in a significant and profound way." This volume includes a selection of seminal papers embodying the work that led to this award, exemplifying Cook's synthesis of ideas and techniques from logic and the theory of computation including NP-completeness, proof complexity, bounded arithmetic, and parallel and space-bounded computation. These papers are accompanied by contributed articles by leading researchers in these areas, which convey to a general reader the importance of Cook's ideas and their enduring impact on the research community. The book also contains biographical material, Cook's Turing Award lecture, and an interview. Together these provide a portrait of Cook as a recognized leader and innovator in mathematics and computer science, as well as a gentle mentor and colleague.
£59.50
