Kaltofen - hybrid methods symnum

Main
Mathematics - Computer Algebra
Kaltofen - hybrid methods symnum

Kaltofen - hybrid methods symnum

Oliver Gloor

0 / 0

როგორ მოგეწონათ ეს წიგნი?

როგორი ხარისხისაა ეს ფაილი?

ჩატვირთეთ, ხარისხის შესაფასებლად

როგორი ხარისხისაა ჩატვირთული ფაილი?

კატეგორია:

Mathematics - Computer Algebra

ენა:

english

გვერდები:

17

ISBN 10:

1581130023

ISBN 13:

9781581130027

ფაილი:

PDF, 169 KB

IPFS:

,

english0

ონლაინ წაკითხვა

ჩატვირთვა (pdf, 169 KB)

ხორციელდება კონვერტაციის -ში

კონვერტაციის -ში ვერ მოხერხდა

შესაძლოა დაგაინტერესოთ

Kahoui. — Elementary subresultants theory. JSC2003

Richardson. — Asymptotic expansion of exp-log functions

Flajolet P., Gourdon X., Panario D. — Complete analysis of a polynomial factorization algorithm over finite fields

Kaltofen, Villard. — Complexity of computing determinants 2001

Kaltofen. — Complexity of polynomial factorization

Kaltofen. — Computing with polynomials by straight-line programs 2. Sparse factorization 1985

— Proceedings ISSAC (Santander) TOC

Dolzmann. — Local quantifier elimination

Champarnaud, Duchamp. — Derivatives of rational expressions and related theorems

— Elimination Methods in Polynomial Computer Algebra

— Proceedings ISSAC (Beijing)

— Proceedings ISSAC 2006 (Genova)

— Proceedings ISSAC 2007

Marie-Claude Gaudel, Gilles Bernot, Egidio Astesiano, Hans-Jörg Kreowski, Bernd Krieg-Brückner — Algebraic Foundations of Systems Specification (IFIP State-of-the-Art Reports)

Chee Keng Yap — Fundamental Problems of Algorithmic Algebra

Yap C.K. — Fundamental problems in algorithmic algebra

Davenport J.H. — Computer algebra

Manocha, Canny. — Multipolynomial resultant algorithms

— Unsolved problems in CAS

Lazard, Rioboo. — Integration of rational functions. Rational computation of logarithmic part

Beckermann, Labahn. — Numerical polynomials relatively prime JSC 1998

Karmarkar, Lakshman. — Approximate GCDs of polynomials JSC 1998

ACM — Proceedings SYMSAC 1976

— fundamental problems in algorithmic algebra. chee keng yap

— Mathematics. Fundamental Problems in Algorithmic Algebra

— Mathematics in Computer Science

I.Z. Emiris, B. Mourrain and V.Y. Pan (eds.) — Theoretical Computer Science, Volume 315, Issues 2-3, Pages 307-672 (6 May 2004), Algebraic and Numerical Algorithms

Y.N. (ed) Lakshman — Proceedings ISSAC (Zurich)

David V. Chudnovsky, Richard D. Jenks — Computers in Mathematics

— International Symposium on Symbolic and Algebraic Computation 92: July 27-29, Berkeley California

Issac — Proceedings ISSAC (Kiev)

Issac — Proceedings ISSAC (Oxford)

A. H. M. Levelt — Issac '95: International Symposium on Symbolic and Algebraic Computation

Wolfgang W. Kuchlin — Issac 97: July 21-23, 1997, Maui, Hawaii, USA: Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computa

Unknown — Proceedings ISSAC 2010 (Munich)

— Proceedings of the 36th international symposium on Symbolic and algebraic computation

Oliver Gloor — Issac 98: August 13-15, 1998, University of Rostock, Germany: Proceedings of the 1998 International Symposium on Symbolic and Al

— Issac 1999 Symposium

— Proceedings ISSAC (St.Andrews)

— 2001 International Symposium on Symbolic and Algebraic Computation

— Issac 2003: Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation: August 3-6, 2003, Philadelphia,

— Proceedings ISSAC (Santander)

საკვანძო ფრაზები