Computational Complexity of Algebraic and Numeric Problems

Main
Mathematics
Computational Complexity of Algebraic...

Computational Complexity of Algebraic and Numeric Problems

Allan Borodin, Ian Munro

0 / 0

Bu kitabı ne kadar beğendiniz?

İndirilen dosyanın kalitesi nedir?

Kalitesini değerlendirmek için kitabı indirin

İndirilen dosyaların kalitesi nedir?

Kategoriler:

Yıl:

1975

Yayımcı:

Elsevier Science Ltd

Dil:

english

Sayfalar:

188

ISBN 10:

0444001689

ISBN 13:

9780444001689

Seriler:

Elsevier computer science library : Theory of computation series ; 1

Dosya:

DJVU, 3.24 MB

IPFS:

,

english, 1975

Online Oku

'e dönüştürme devam ediyor

dosyasına dönüştürme başarısız oldu

İlginizi çekebilir

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

Roberto Bevilacqua, et al. — Complexity of structured computational problems

Mehlhorn K., Yap C — Robust Geometric Computation

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

ACM — Proceedings SYMSAC 1976

Huang, Pan. — Fast rectangular matrix multiplication 1998

Blaser M. — Complexity of Bilinear Problems, lecture notes

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

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman — The Design and Analysis of Computer Algorithms

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

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

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

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

— Proceedings ISSAC (Portland)

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

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

Shmuel Winograd — Arithmetic complexity of computations

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

Unknown — Proceedings ISSAC 2010 (Munich)

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

Miller R.E., Thatcher J.W. (eds.) — Complexity of computer computations (proc.)

— 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 (Beijing)

— Proceedings ISSAC 2006 (Genova)

— Proceedings ISSAC 2007

— Proceedings ISSAC 2008 (ACM)

— Proceedings ISSAC 2009 (Seoul)

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

François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov — Computer Algebra in Scientific Computing: 22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings

Anahtar ifadeler