Skip to main content
Search Button
United States Kobo store Gift Cards Help

Rakuten Kobo

Wishlist

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


Showing 1 - 12 of 12 results for “rolf s rees”
Skip side bar filters

  • Graphs, Matrices, and Designs

    by Rolf S. Rees ...
    Series series Lecture Notes in Pure and Applied Mathematics
    Examines partitions and covers of graphs and digraphs, latin squares, pairwise balanced designs with prescribed block sizes, ranks and permanents, extremal graph theory, Hadamard matrices and graph factorizations. This book is designed to be of interest to applied mathematicians, computer scientists and communications researchers. ... Read more

    $395.00 USD

People who read this 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

  • Principles And Techniques In Combinatorics

    by Chuan Chong Chen, Khee-meng Koh ...

    $27.89 USD

  • A Walk Through Combinatorics

    An Introduction to Enumeration, Graph Theory, and Selected Other Topics

    by Miklós Bóna ...
    The first half of the book walks the reader through methods of counting, both direct elementary methods and the more advanced method of generating functions. Then, in the second half of the book, the reader learns how to apply these methods to fascinating objects, such as graphs, designs, random variables, partially ordered sets, and algorithms. In short, the first half emphasizes depth by ... Read more

    $45.89 USD

  • A Course in Combinatorics

    by J. H. van Lint, R. M. Wilson ...
    This is the second edition of a popular book on combinatorics, a subject dealing with ways of arranging and distributing objects, and which involves ideas from geometry, algebra and analysis. The breadth of the theory is matched by that of its applications, which include topics as diverse as codes, circuit design and algorithm complexity. It has thus become essential for workers in many scientific ... Read more

    $97.59 USD

  • Computational Complexity

    A Modern Approach

    by Sanjeev Arora, Boaz Barak ...
    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

  • Topics in Algebraic Graph Theory

    Edited by Lowell W. Beineke, Robin J. Wilson, Peter J. Cameron ...
    Series Book 102 - Encyclopedia of Mathematics and its Applications
    The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explore various aspects of graph theory: linear algebra (for spectral theory) and group theory (for studying graph symmetry). These areas have links with other areas of mathematics, such as logic and harmonic analysis, and are increasingly being used in such areas as computer networks where symmetry is ... Read more

    $133.69 USD

  • Algebraic Coding Theory (Revised Edition)

    by Elwyn R Berlekamp ...
    This is the revised edition of Berlekamp's famous book, 'Algebraic Coding Theory', originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering practice in this field. One of these is an algorithm for decoding Reed-Solomon and Bose-Chaudhuri-Hocquenghem codes that subsequently became known as the Berlekamp-Massey Algorithm. Another is the ... Read more

    $53.99 USD

  • Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory (Second Edition)

    by Miklos Bona ...
    This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their ... Read more

    $62.99 USD

  • Handbook of Discrete and Combinatorial Mathematics

    Edited by Kenneth H. Rosen ...
    Series series Discrete Mathematics and Its Applications
    Handbook of Discrete and Combinatorial Mathematics provides a comprehensive reference volume for mathematicians, computer scientists, engineers, as well as students and reference librarians.The material is presented so that key information can be located and used quickly and easily. Each chapter includes a glossary. Individual topics are covered in sections and subsections within chapters, each of ... Read more

    $345.00 USD

  • Algorithms for Sparse Linear Systems

    by Jennifer Scott, Miroslav Tůma ...
    Series series Mathematics and Statistics (R0)
    Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This open access monograph focuses on factorization algorithms for solving such systems. It presents classical techniques for complete factorizations that are used in sparse direct methods and discusses the computation of approximate direct and inverse factorizations that are key to constructing general ... Read more

    Free

  • Basic Phylogenetic Combinatorics

    by Andreas Dress, Katharina T. Huber, Jacobus Koolen, Vincent Moulton, Andreas Spillner ...
    Phylogenetic combinatorics is a branch of discrete applied mathematics concerned with the combinatorial description and analysis of phylogenetic trees and related mathematical structures such as phylogenetic networks and tight spans. Based on a natural conceptual framework, the book focuses on the interrelationship between the principal options for encoding phylogenetic trees: split systems, ... Read more

    $54.99 USD