Skip to main content

Shopping Cart

You're getting the VIP treatment!

Item(s) unavailable for purchase
Please review your cart. You can remove the unavailable item(s) now or we'll automatically remove it at Checkout.
itemsitem
itemsitem

Recommended For You

Loading...
  • Invariance of Modules under Automorphisms of their Envelopes and Covers

    Series Book 466 - London Mathematical Society Lecture Note Series
    The theory of invariance of modules under automorphisms of their envelopes and covers has opened up a whole new direction in the study of module theory. It offers a new perspective on generalizations of injective, pure-injective and flat-cotorsion modules beyond relaxing conditions on liftings of homomorphisms. This has set off a flurry of work in the area, with hundreds of papers using the theory ... Read more

    $45.99 USD

  • Formal Matrices

    Series series Mathematics and Statistics (R0)
    This monograph is a comprehensive account of formal matrices, examining homological properties of modules over formal matrix rings and summarising the interplay between Morita contexts and K theory.While various special types of formal matrix rings have been studied for a long time from several points of view and appear in various textbooks, for instance to examine equivalences of module ... Read more

    $89.99 USD

People who read these also enjoyed

  • Art of Computer Programming, The

    Seminumerical Algorithms, Volume 2

    by Donald Knuth ...
    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 ... Read more

    $68.39 USD

  • Introduction to the Analysis of Algorithms, An

    Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field.Robert Sedgewick and the late Philippe Flajolet ... Read more

    $69.29 USD

  • Cryptographic Boolean Functions and Applications

    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 ... Read more

    $57.59 USD

  • Computability Theory

    An Introduction to Recursion Theory

    Computability Theory: An Introduction to Recursion Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion ... Read more

    $56.69 USD

  • Algebraic Geometry Modeling In Information Theory

    Series Book 8 - Series On Coding Theory And Cryptology
    Algebraic & geometry methods have constituted a basic background and tool for people working on classic block coding theory and cryptography. Nowadays, new paradigms on coding theory and cryptography have arisen such as: Network coding, S-Boxes, APN Functions, Steganography and decoding by linear programming. Again understanding the underlying procedure and symmetry of these topics needs a whole ... Read more

    $41.39 USD

  • Computational Complexity

    A Modern Approach

    This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and ... Read more

    $65.59 USD

  • Handbook of Process Algebra

    Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity ... Read more

    $305.99 USD

  • Applied Number Theory

    Series series Mathematics and Statistics (R0)
    This textbook effectively builds a bridge from basic number theory to recent advances in applied number theory. It presents the first unified account of the four major areas of application where number theory plays a fundamental role, namely cryptography, coding theory, quasi-Monte Carlo methods, and pseudorandom number generation, allowing the authors to delineate the manifold links and ... Read more

    $58.49 USD

  • Graph Representation Learning

    Series series Synthesis Lectures on Artificial Intelligence and Machine Learning
    This book is a foundational guide to graph representation learning, including state-of-the art advances, and introduces the highly successful graph neural network (GNN) formalism.Graph-structured data is ubiquitous throughout the natural and social sciences, from telecommunication networks to quantum chemistry. Building relational inductive biases into deep learning architectures is crucial for ... Read more

    $43.99 USD

  • The Design of Approximation Algorithms

    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 ... Read more

    $69.69 USD