Modular Algorithms in Symbolic Summation and Symbolic...

Main
Mathematics - Computer Algebra
Modular Algorithms in Symbolic...

Modular Algorithms in Symbolic Summation and Symbolic Integration

Jürgen Gerhard

0 / 4.0

How much do you like this book?

What’s the quality of the file?

Download the book for quality assessment

What’s the quality of the downloaded files?

PhD Thesis

Categories:

Mathematics - Computer Algebra

Year:

2004

Publisher:

Springer

Language:

english

ISBN 10:

3540240616

ISBN 13:

9783540240617

ISBN:

2004115730

Series:

Lecture Notes in Computer Science

File:

PDF, 3.49 MB

IPFS:

,

english, 2004

Download (pdf, 3.49 MB)

Conversion to is in progress

Conversion to is failed

You may be interested in

von zur Gathen J., Gerhard J. — Modern computer algebra, Solutions for selected exercises

von zur Gathen J., Gerhard J. — Lecture notes on computer algebra 1

von zur Gathen J., Gerhard J. — Lecture notes on computer algebra 2

Wieb Bosma [Wieb Bosma] — LNCS 1838 - Algorithmic Number Theory (Frontmatter Pages)

Davenport J.H. — Computer algebra

Davenport J.H. — Computer algebra

Anne Frühbis-Krüger, Christoph Lossen — Introduction to Computer Algebra (Solving Systems of Polynomial Equations) [Lecture notes]

Andrea Munaro — Factoring polynomials over number fields

O. N. Vasilenko — Number-Theoretic Algorithms in Cryptography

Davenport J.H. — Computer algebra

Horowitz. — Finite fields and modular arithmetic, tutorial

Cohen H. (ed.) — Algorithmic number theory (Proc. ANTS-II, Springer 1996)(selected papers)

David R Musser — Multivariate polynomial factorization

Kaltofen. — Complexity of polynomial factorization

Landau S. — Galois groups and solvability in radicals (phd thesis 1983)

Horowitz. — Finite fields and modular arithmetic, tutorial

Horowitz. — Algorithms for rational function arithmetic

Victor Shoup — A Computational Introduction To Number Theory and Algebra

Chee Keng Yap — Fundamental Problems of Algorithmic Algebra

Eric Bach, Jeffrey Shallit — Algorithmic number theory: Efficient algorithms

Alkiviadis G. Akritas — Elements of Computer Algebra With Applications

Joachim von zur Gathen, Jürgen Gerhard — Modern computer algebra

Joachim von zur Gathen, Jürgen Gerhard — Modern computer algebra

K. Geddes, S. Czapor, G. Labahn — Algorithms for Computer Algebra

R E Zippel — Effective polynomial computation

O. N. Vasilenko — Number-theoretic Algorithms in Cryptography

Trevisan. — Practical factorization of polynomials over finite fields

Encarnacion. — Factoring polynomials over algebraic numbers

Joachim von zur Gathen, Jürgen Gerhard — Modern Computer Algebra

— Proceedings ISSAC (Santander)

Kiran S. Kedlaya (auth.), Duncan Buell (eds.) — Algorithmic Number Theory: 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings

Buchberger B., Collins G.E., Loos R. (eds.) — Computer Algebra: Symbolic and Algebraic Computation

Prof. Dr. R. Loos (auth.), Prof. Dr. Bruno Buchberger, Prof. Dr. George Edwin Collins, Prof. Dr. Rüdiger Loos (eds.) — Computer Algebra: Symbolic and Algebraic Computation

Prof. Dr. R. Loos (auth.), Prof. Dr. Bruno Buchberger, Prof. Dr. George Edwin Collins, Prof. Dr. Rüdiger Loos, Prof. Dr. Rudolf Albrecht (eds.) — Computer Algebra: Symbolic and Algebraic Computation

Franz Winkler — Polynomial Algorithms in Computer Algebra (Texts and mongraphs in symbolic computation)

Most frequently terms