Simplification of unnested radicals

Main
Mathematics - Computer Algebra
Simplification of unnested radicals

Simplification of unnested radicals

Caviness, Fateman.

0 / 0

Jak bardzo podobała Ci się ta książka?

Jaka jest jakość pobranego pliku?

Pobierz książkę, aby ocenić jej jakość

Jaka jest jakość pobranych plików?

Kategorie:

Mathematics - Computer Algebra

Język:

english

Strony:

10

Plik:

DJVU, 208 KB

IPFS:

,

english0

Ściągnij (djvu, 208 KB)

Trwa konwersja do

Konwersja do nie powiodła się

Możesz być zainteresowany

Ziming Li. — Lecture notes on computer algebra

Richard Eliot Zippel — Simplification of radicals

Caviness. — On canonical forms and simplification

Rubio. — Functional decomposition (ext.abs.)

Baumann. — Solution of ODEs with MathLie

Gutierrez, Recio. — Implementation of rational function decomposition

Chapman F.W. — Automatic derivation of product identities

Davenport J.H., Siret Y., Tournier E. — Computer algebra: Systems and algorithms for algebraic computation

Henry Cohn, Joshua Greene, Jonathan Hanke — Algebraic number theory and quadratic reciprocity [Lecture notes]

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

Davenport, Trager. — Factoring polynomials over algebraic domains

Weinberger, Rothshild. — Factoring polynomials over algebraic numbers 1976

Trager. — Algebraic factoring and integration of rational functions

David R Musser — Multivariate polynomial factorization

Wang. — Factoring multivariate polynomials over algebraic number fields

Kaltofen. — Complexity of polynomial factorization

— Proceedings SYMSAC 1971

ACM — Proceedings SYMSAC 1976

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

Landau S. — Simplification of nested radicals (SIAM J Comp. 1992)

Zippel. — Simplification of radicals (JSC 1985)(dirtier)

Fateman. — Essays in algebraic simplification (phd thesis)

Briggs M. — An Introduction to the General Number Field Sieve

van der Waerden B.L. — Modern Algebra I

J. H. Davenport — Computer Algebra: Systems and Algorithms for Algebraic Computation

J. H. Davenport, Y. Siret, Evelyne Tournier — Computer Algebra: Systems and Algorithms for Algebraic Computation

Harold M. Edwards — Essays in Constructive Mathematics

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

J.P. Buhler, P. Stevenhagen — Algorithmic number theory: lattices, number fields, curves and cryptography

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

R E Zippel — Effective polynomial computation

Charles Robert Hadlock — Field Theory and Its Classical Problems (Carus Mathematical Monographs ; No. 19)

Charles Robert Hadlock — Field Theory and Its Classical Problems

Bruce W. Char — Proceedings SYMSAC 1986 (ACM)

— Proceedings EUROSAM 1984 (selected papers)(SIGSAM, ACM)

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

Kenneth R. Davidson, Matthew Satriano — Integer and Polynomial Algebra

Ian Nicholas Stewart — Galois Theory

Joel S. Cohen — Computer Algebra and Symbolic Computation: Mathematical Methods

Hanrot. — Algorithmic solvability in radicals

Ian N. Stewart — Galois theory

Najbardziej popularne frazy