Tags
Language
Tags
July 2025
Su Mo Tu We Th Fr Sa
29 30 1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30 31 1 2
    Attention❗ To save your time, in order to download anything on this site, you must be registered 👉 HERE. If you do not have a registration yet, it is better to do it right away. ✌

    ( • )( • ) ( ͡⚆ ͜ʖ ͡⚆ ) (‿ˠ‿)
    SpicyMags.xyz

    Computational and Algorithmic Problems in Finite Fields

    Posted By: AvaxGenius
    Computational and Algorithmic Problems in Finite Fields

    Computational and Algorithmic Problems in Finite Fields by Igor E. Shparlinski
    English | PDF | 1992 | 253 Pages | ISBN : 0792320573 | 34.9 MB

    This volume presents an exhaustive treatment of computation and algorithms for finite fields.
    Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other araes of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc.) The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics.
    The level of discussion presuppose only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text.
    For researchers and students interested in computational and algorithmic problems in finite fields.

    Maple V: Learning Guide

    Posted By: AvaxGenius
    Maple V: Learning Guide

    Maple V: Learning Guide by K. M. Heal , M. L. Hansen , K. M. Rickard
    English | PDF | 1997 | 297 Pages | ISBN : 038798397X | 21.9 MB

    Maple V Mathematics Learning Guide is the fully revised introductory documentation for Maple V Release 5. It shows how to use Maple V as a calculator with instant access to hundreds of high-level math routines and as a programming language for more demanding or specialized tasks. Topics include the basic data types and statements in the Maple V language. The book serves as a tutorial introduction and explains the difference between numeric computation and symbolic computation, illustrating how both are used in Maple V Release 5. Extensive "how-to" examples are presented throughout the text to show how common types of calculations can be easily expressed in Maple. Graphics examples are used to illustrate the way in which 2D and 3D graphics can aid in understanding the behaviour of problems.

    Some Tapas of Computer Algebra (Repost)

    Posted By: AvaxGenius
    Some Tapas of Computer Algebra (Repost)

    Some Tapas of Computer Algebra by Arjeh M. Cohen, Hans Cuypers, Hans Sterk
    English | PDF | 1999 | 365 Pages | ISBN : 3540634800 | 29.3 MB

    In the years 1994, 1995, two EIDMA mini courses on Computer Algebra were given at the Eindhoven University of Technology by, apart from ourselves, various invited lecturers. (EIDMA is the Research School 'Euler Institute for Discrete Mathematics and its Applications'.) The idea of the courses was to acquaint young mathematicians with algorithms and software for mathemat­ ical research and to enable them to incorporate algorithms in their research. A collection of lecture notes was used at these courses. When discussing these courses in comparison with other kinds of courses one might give in a week's time, Joachim Neubüser referred to our courses as 'tapas'. This denomination underlined that the courses consisted of appe­ tizers for various parts of algorithmic algebra; indeed, we covered such spicy topics as the link between Gröbner bases and integer programming, and the detection of algebraic solutions to differential equations. As a collection, the not es turned out to have some appeal of their own, which is the main reason why the idea came up of transforming them into book form. We feIt however, that the book should be distinguishable from a standard text book on computer algebra in that it retains its appetizing flavour by presenting a variety of topics at an accessible level with a view to recent developments.

    Geometric Patterns with Creative Coding: Coding for the Arts (Repost)

    Posted By: AvaxGenius
    Geometric Patterns with Creative Coding: Coding for the Arts (Repost)

    Geometric Patterns with Creative Coding: Coding for the Arts by Selçuk Artut
    English | PDF EPUB (True) | 2023 | 410 Pages | ISBN : 1484293886 | 153.6 MB

    Facilitate coding in generating geometric motives with a special focus on analyzing their geometric formulations. This book aims to teach analytical coding skills by combining arts and mathematics.

    Algebra, Geometry and Software Systems

    Posted By: AvaxGenius
    Algebra, Geometry and Software Systems

    Algebra, Geometry and Software Systems by Michael Joswig, Nobuki Takayama
    English | PDF (True) | 332 Pages | ISBN : 3540002561 | 31 MB

    In many fields of modern mathematics specialised scientific software becomes increasingly important. Hence, tremendous effort is taken by numerous groups all over the world to develop appropriate solutions.
    This book contains surveys and research papers on mathematical software and algorithms. The common thread is that the field of mathematical applications lies on the border between algebra and geometry. Topics include polyhedral geometry, elimination theory, algebraic surfaces, Gröbner bases, triangulations of point sets and the mutual relationship. This diversity is accompanied by the abundance of available software systems which often handle only special mathematical aspects. Therefore the volume's other focus is on solutions towards the integration of mathematical software systems. This includes low-level and XML based high-level communication channels as well as general framework for modular systems.

    A Course in Computational Algebraic Number Theory

    Posted By: AvaxGenius
    A Course in Computational Algebraic Number Theory

    A Course in Computational Algebraic Number Theory by Henri Cohen
    English | PDF | 1993 | 556 Pages | ISBN : 3540556400 | 50.2 MB

    With the advent of powerful computing tools and numerous advances in math­ ematics, computer science and cryptography, algorithmic number theory has become an important subject in its own right. Both external and internal pressures gave a powerful impetus to the development of more powerful al­ gorithms. These in turn led to a large number of spectacular breakthroughs. To mention but a few, the LLL algorithm which has a wide range of appli­ cations, including real world applications to integer programming, primality testing and factoring algorithms, sub-exponential class group and regulator algorithms, etc … Several books exist which treat parts of this subject. (It is essentially impossible for an author to keep up with the rapid pace of progress in all areas of this subject.) Each book emphasizes a different area, corresponding to the author's tastes and interests. The most famous, but unfortunately the oldest, is Knuth's Art of Computer Programming, especially Chapter 4. The present book has two goals. First, to give a reasonably comprehensive introductory course in computational number theory. In particular, although we study some subjects in great detail, others are only mentioned, but with suitable pointers to the literature. Hence, we hope that this book can serve as a first course on the subject. A natural sequel would be to study more specialized subjects in the existing literature.

    Computer Algebra Recipes: An Advanced Guide to Scientific Modeling

    Posted By: AvaxGenius
    Computer Algebra Recipes: An Advanced Guide to Scientific Modeling

    Computer Algebra Recipes: An Advanced Guide to Scientific Modeling by Richard H. Enns , George C. McGuire
    English | PDF | 2007 | 374 Pages | ISBN : 0387257683 | 7.2 MB

    Modern computer algebra systems are revolutionizing the teaching and learning of mathematically intensive subjects in science and engineering, enabling students to explore increasingly complex and computationally intensive models that provide analytic solutions, animated numerical solutions, and complex two- and three-dimensional graphic displays.

    Continuous System Simulation

    Posted By: AvaxGenius
    Continuous System Simulation

    Continuous System Simulation by François E. Cellier , Ernesto Kofman
    English | PDF | 2006 | 659 Pages | ISBN : 0387261028 | 4.8 MB

    Continuous System Simulation describes systematically and methodically how mathematical models of dynamic systems, usually described by sets of either ordinary or partial differential equations possibly coupled with algebraic equations, can be simulated on a digital computer.

    Non-Functional Requirements in Software Engineering

    Posted By: AvaxGenius
    Non-Functional Requirements in Software Engineering

    Non-Functional Requirements in Software Engineering by Lawrence Chung , Brian A. Nixon , Eric Yu , John Mylopoulos
    English | PDF | 2000 | 458 Pages | ISBN : 0792386663 | 37.4 MB

    Non-Functional Requirements in Software Engineering presents a systematic and pragmatic approach to `building quality into' software systems. Systems must exhibit software quality attributes, such as accuracy, performance, security and modifiability. However, such non-functional requirements (NFRs) are difficult to address in many projects, even though there are many techniques to meet functional requirements in order to provide desired functionality. This is particularly true since the NFRs for each system typically interact with each other, have a broad impact on the system and may be subjective.

    D-Finite Functions

    Posted By: AvaxGenius
    D-Finite Functions

    D-Finite Functions by Manuel Kauers
    English | PDF (True) | 2023 | 699 Pages | ISBN : 3031346513 | 16.6 MB

    Defined as solutions of linear differential or difference equations with polynomial coefficients, D-finite functions play an important role in various areas of mathematics. This book is a comprehensive introduction to the theory of these functions with a special emphasis on computer algebra algorithms for computing with them: algorithms for detecting relations from given data, for evaluating D-finite functions, for executing closure properties, for obtaining various kinds of “explicit” expressions, for factoring operators, and for definite and indefinite symbolic summation and integration are explained in detail.

    Functional Decomposition with Applications to FPGA Synthesis

    Posted By: AvaxGenius
    Functional Decomposition with Applications to FPGA Synthesis

    Functional Decomposition with Applications to FPGA Synthesis by Christoph Scholl
    English | PDF | 2001 | 274 Pages | ISBN : 0792375858 | 23.8 MB

    During the last few years Field Programmable Gate Arrays (FPGAs) have become increasingly important. Thanks to recent breakthroughs in technology, FPGAs offer millions of system gates at low cost and considerable speed.
    Functional decomposition has emerged as an essential technique in automatic logic synthesis for FPGAs. Functional decomposition as a technique to find realizations for Boolean functions was already introduced in the late fifties and early sixties by Ashenhurst, Curtis, Roth and Karp. In recent years, however, it has attracted a great deal of renewed attention, for several reasons. First, it is especially well suited for the synthesis of lookup-table based FPGAs.

    Algorithms and Complexity

    Posted By: AvaxGenius
    Algorithms and Complexity

    Algorithms and Complexity: 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023, Proceedings by Marios Mavronicolas
    English | PDF,EPUB | 2023 | 412 Pages | ISBN : 3031304470 | 48 MB

    This book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13–16, 2023.
    The 25 full papers included in this book were carefully reviewed and selected from 49 submissions. They cover all important areas of research on algorithms and complexity such as algorithm design and analysis; sequential, parallel and distributed algorithms; data structures; computational and structural complexity; lower bounds and limitations of algorithms; randomized and approximation algorithms; parameterized algorithms and parameterized complexity classes; smoothed analysis of algorithms; alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions), on-line computation and competitive analysis, streaming algorithms, quantum algorithms and complexity, algorithms in algebra, geometry, number theory and combinatorics, computational geometry, algorithmic game theory and mechanism design, algorithmic economics (including auctions and contests), computational learning theory, computational biology and bioinformatics, algorithmic issues in communication networks, algorithms for discrete optimization (including convex optimization) and algorithm engineering.

    Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms

    Posted By: AvaxGenius
    Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms

    Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms by Abel J. P. Gomes, Irina Voiculescu, Joaquim Jorge, Brian Wyvill, Callum Galbraith
    English | PDF (True) | 2009 | 351 Pages | ISBN : 184882405X | 67.4 MB

    Implicit objects have gained increasing importance in geometric modeling, visualisation, animation, and computer graphics, because their geometric properties provide a good alternative to traditional parametric objects. This book presents the mathematics, computational methods and data structures, as well as the algorithms needed to render implicit curves and surfaces, and shows how implicit objects can easily describe smooth, intricate, and articulatable shapes, and hence why they are being increasingly used in graphical applications.

    A Singular Introduction to Commutative Algebra, Second, Extended Edition (Repost)

    Posted By: AvaxGenius
    A Singular Introduction to Commutative Algebra, Second, Extended Edition (Repost)

    A Singular Introduction to Commutative Algebra, Second, Extended Edition by Gert-Martin Greuel , Gerhard Pfister
    English | PDF(True) | 2008 | 703 Pages | ISBN : 3540735410 | 9.9 MB

    From the reviews of the first edition:
    "It is certainly no exaggeration to say that … A Singular Introduction to Commutative Algebra aims to lead a further stage in the computational revolution in commutative algebra … . Among the great strengths and most distinctive features … is a new, completely unified treatment of the global and local theories. … making it one of the most flexible and most efficient systems of its type….another strength of Greuel and Pfister's book is its breadth of coverage of theoretical topics in the portions of commutative algebra closest to algebraic geometry, with algorithmic treatments of almost every topic….Greuel and Pfister have written a distinctive and highly useful book that should be in the library of every commutative algebraist and algebraic geometer, expert and novice alike."

    A Singular Introduction to Commutative Algebra

    Posted By: AvaxGenius
    A Singular Introduction to Commutative Algebra

    A Singular Introduction to Commutative Algebra by Gert-Martin Greuel , Gerhard Pfister
    English | PDF(True) | 2002 | 601 Pages | ISBN : 3540428976 | 46 MB

    In theory there is no difference between theory and practice. In practice there is. Yogi Berra A SINGULAR Introduction to Commutative Algebra offers a rigorous intro­ duction to commutative algebra and, at the same time, provides algorithms and computational practice. In this book, we do not separate the theoretical and the computational part. Coincidentally, as new concepts are introduced, it is consequently shown, by means of concrete examples and general proce­ dures, how these concepts are handled by a computer. We believe that this combination of theory and practice will provide not only a fast way to enter a rather abstract field but also a better understanding of the theory, showing concurrently how the theory can be applied. We exemplify the computational part by using the computer algebra sys­ tem SINGULAR, a system for polynomial computations, which was developed in order to support mathematical research in commutative algebra, algebraic geometry and singularity theory. As the restriction to a specific system is necessary for such an exposition, the book should be useful also for users of other systems (such as Macaulay2 and CoCoA) with similar goals. Indeed, once the algorithms and the method of their application in one system is known, it is usually not difficult to transfer them to another system.