Complexity of polynomial factorization

Main
Mathematics - Computer Algebra
Complexity of polynomial factorization

Complexity of polynomial factorization

Kaltofen.

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

Rok:

1982

Wydanie:

PhD Thesis

Język:

english

Strony:

101

Plik:

PDF, 359 KB

IPFS:

,

english, 1982

Czytaj Online

Trwa konwersja do

Konwersja do nie powiodła się

Możesz być zainteresowany

Algorex, Inc. — Simulink - CDMA Reference Blockset For Use with Simulink User’s Guide Version 1

David R Musser — Multivariate polynomial factorization

Kaltofen, Villard. — Complexity of computing determinants 2001

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)

— Proceedings ISSAC 2007

H. Lidl, H. Niederreiter — Introduction to Finite Fields and their Applications

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

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

Mark Reeder — Notes on Galois Theory

Filaseta M. — Irreducible polynomials theory

Weinberger, Rothshild. — Factoring polynomials over algebraic numbers 1976

Moses, Yun. — The EZ polynomial GCD algorithm

Viry. — Factorization of polynomials in Fp[x]

Wang, Rothschild. — Factoring multivariate polynomials over integers

Wang. — Factoring multivariate polynomials over algebraic number fields

Wang. — Improved multivariate polynomial factoring algorithm

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

Singer. — Lectures on computer algebra (pdfs)

Pohst M. — Algorithmic methods in algebra and number theory

Harold M. Edwards — Essays in Constructive Mathematics

Teo Mora — Solving Polynomial Equation Systems

Rudolf Lidl, Harald Niederreiter — Introduction to Finite Fields

Niederreiter, Harald;Lidl, Rudolf — Introduction to finite fields and their applications

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

Teo Mora — Solving polynomial equation systems I: the Kronecker-Duval philosophy

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

Swallow J. — Exploratory Galois Theory

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

R E Zippel — Effective polynomial computation

Kaltofen. — Polynomial reduction to 2 variables

Lucks. — New algorithm for fast integer polynomial factorization

Shamir. — Generation of hard to factor multivariate polynomials

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

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

Najbardziej popularne frazy