Proceedings ISSAC 2007

Main
Mathematics - Computer Algebra
Proceedings ISSAC 2007

Proceedings ISSAC 2007

0 / 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?

Categories:

Mathematics - Computer Algebra

Publisher:

Waterloo

Language:

english

Pages:

402

ISBN 10:

1595937439

ISBN 13:

9781595937438

File:

PDF, 10.74 MB

IPFS:

,

english0

Read Online

Conversion to is in progress

Conversion to is failed

You may be interested in

Filaseta, Schinzel. — Irreducibility and GCD algorithms for sparse polynomials

Richardson. — Asymptotic expansion of exp-log functions

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

Oliver Gloor — Kaltofen - hybrid methods symnum

— Proceedings ISSAC (Beijing)

— Proceedings ISSAC 2006 (Genova)

Chee Keng Yap — Fundamental Problems of Algorithmic Algebra

Chee-Keng Yap — Fundamental problems of algorithmic algebra (draft)

Hoon Hong (Editor) — Journal of Symbolic Computation, Volume 33, issues 1-6 33 1-6

Bob Caviness (Editor) — Journal of Symbolic Computation, Volume 20, issues 1-6 issue 1-6

Yap C.K. — Fundamental problems in algorithmic algebra

Davenport J.H. — Computer algebra

Davenport J.H. — Computer algebra

S. A. Abramov, M. A. Barkatou, D. E. Khmelnov (auth.), Vladimir P. Gerdt, Ernst W. Mayr, Evgenii V. Vorozhtsov (eds.) — Computer Algebra in Scientific Computing: 11th International Workshop, CASC 2009, Kobe, Japan, September 13-17, 2009. Proceedings

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

ACM — Proceedings SYMSAC 1976

— fundamental problems in algorithmic algebra. chee keng yap

— Mathematics. Fundamental Problems in Algorithmic Algebra

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)

Allan Borodin, Ian Munro — Computational Complexity of Algebraic and Numeric Problems

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

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

von zur Gathen J., Gerhard J. — Modern computer algebra

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

Teo Mora — ISSAC 2002 : July 07-10, 2002, Université de Lille, Lille, France : Proceedings of the 2002 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)

— Proceedings ISSAC 2008 (ACM)

— Proceedings ISSAC 2009 (Seoul)

Most frequently terms