Utvidet returrett til 31. januar 2025

Bøker i Algorithms and Computation in Mathematics-serien

Filter
Filter
Sorter etterSorter Serierekkefølge
  • av Dimitry Kozlov
    1 080,-

    Combinatorial algebraic topology is a fascinating and dynamic field at the crossroads of algebraic topology and discrete mathematics. This volume is the first comprehensive treatment of the subject in book form.

  • - The Formal Theory of Differential Equations and its Applications in Computer Algebra
    av Werner M. Seiler
    1 613 - 1 933,-

    The book provides a self-contained account of the formal theory of general, i.e. also under- and overdetermined, systems of differential equations which in its central notion of involution combines geometric, algebraic, homological and combinatorial ideas.

  • av Michael Yampolsky & Mark L. Braverman
    669,-

    Among all computer-generated mathematical images, Julia sets of rational maps occupy one of the most prominent positions. This accessible book summarizes the present knowledge about the computational properties of Julia sets in a self-contained way.

  • av Victor V. Prasolov
    809,-

    This comprehensive book covers both long-standing results in the theory of polynomials and recent developments. After initial chapters on the location and separation of roots and on irreducibility criteria, the book covers more specialized polynomials.

  • av Neil J. A. Sloane, Gabriele Nebe & Eric M. Rains
    2 061,-

    One of the most remarkable theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes and their connections with invariant theory. This book develops a new theory which is powerful enough to include all the earlier generalizations. It is also in part an extensive encyclopedia listing the different types of self-dual codes and their properties.

  • av Peter Burgisser
    1 371,-

    This is a thorough and comprehensive treatment of the theory of NP-completeness in the framework of algebraic complexity theory. Coverage includes Valiant's algebraic theory of NP-completeness; interrelations with the classical theory as well as the Blum-Shub-Smale model of computation, questions of structural complexity;

  • av Geon Ho Choe
    1 039,-

    Ergodic theory is hard to study because it is based on measure theory, which is a technically difficult subject to master for ordinary students, especially for physics majors. One last remark: The last chapter explains the relation between entropy and data compression, which belongs to information theory and not to ergodic theory.

  •  
    717,-

    This book presents the basic concepts and algorithms of computer algebra using practical examples that illustrate their actual use in symbolic computation.

  • av Antonio Montes
    1 661,-

    This book is divided into two parts, one theoretical and one focusing on applications, and offers a complete description of the Canonical Groebner Cover, the most accurate algebraic method for discussing parametric polynomial systems.

  •  
    1 371,-

    This edited volume presents a fascinating collection of lecture notes focusing on differential equations from two viewpoints: formal calculus (through the theory of Groebner bases) and geometry (via quiver theory).

  • av Dirk Hachenberger
    1 507,-

  •  
    1 371,-

    This edited volume presents a fascinating collection of lecture notes focusing on differential equations from two viewpoints: formal calculus (through the theory of Groebner bases) and geometry (via quiver theory).

  • av Oleg N. Karpenkov
    578,-

Gjør som tusenvis av andre bokelskere

Abonner på vårt nyhetsbrev og få rabatter og inspirasjon til din neste leseopplevelse.