1996, ISBN: 3211827595
[EAN: 9783211827598], Neubuch, [SC: 0.0], [PU: Springer Vienna], ALGORITHM; COMPLEXITY; COMPUTERALGEBRA; COMPUTERSCIENCE; DATASTRUCTURES; ALGORITHMANALYSISANDPROBLEMCOMPLEXITY, Druck auf … Plus…
ZVAB.com AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00) Details... |
ISBN: 9783211827598
For several years now I have been teaching courses in computer algebra at the Universitat Linz, the University of Delaware, and the Universidad de Alcala de Henares. In the summers of 199… Plus…
BarnesandNoble.com new in stock. Frais d'envoizzgl. Versandkosten., Livraison non-comprise Details... |
Polynomial Algorithms in Computer Algebra (Texts and mongraphs in symbolic computation) - Première édition
2013, ISBN: 9783211827598
Livres de poche
Springer, Taschenbuch, Auflage: 1. 270 Seiten, Publiziert: 2013-10-04T00:00:01Z, Produktgruppe: Buch, 1.13 kg, Verkaufsrang: 3351194, Datenbanken, Computer & Internet, Kategorien, Bücher,… Plus…
Amazon.de (Intern... Ammareal - Professional Gut Frais d'envoiAuf Lager. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) Details... |
Polynomial Algorithms in Computer Algebra (Texts and mongraphs in symbolic computation) - Première édition
2013, ISBN: 9783211827598
Livres de poche
Springer, Taschenbuch, Auflage: 1. 270 Seiten, Publiziert: 2013-10-04T00:00:01Z, Produktgruppe: Buch, 1.13 kg, Verkaufsrang: 3351194, Datenbanken, Computer & Internet, Kategorien, Bücher,… Plus…
Amazon.de (Intern... Frais d'envoiDie angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) Details... |
Polynomial Algorithms in Computer Algebra (Texts and mongraphs in symbolic computation) - Première édition
2013, ISBN: 9783211827598
Livres de poche
Springer, Taschenbuch, Auflage: 1. 270 Seiten, Publiziert: 2013-10-04T00:00:01Z, Produktgruppe: Buch, 1.13 kg, Verkaufsrang: 3351194, Datenbanken, Computer & Internet, Kategorien, Bücher,… Plus…
Amazon.de (Intern... |
1996, ISBN: 3211827595
[EAN: 9783211827598], Neubuch, [SC: 0.0], [PU: Springer Vienna], ALGORITHM; COMPLEXITY; COMPUTERALGEBRA; COMPUTERSCIENCE; DATASTRUCTURES; ALGORITHMANALYSISANDPROBLEMCOMPLEXITY, Druck auf … Plus…
ISBN: 9783211827598
For several years now I have been teaching courses in computer algebra at the Universitat Linz, the University of Delaware, and the Universidad de Alcala de Henares. In the summers of 199… Plus…
Polynomial Algorithms in Computer Algebra (Texts and mongraphs in symbolic computation) - Première édition
2013
ISBN: 9783211827598
Livres de poche
Springer, Taschenbuch, Auflage: 1. 270 Seiten, Publiziert: 2013-10-04T00:00:01Z, Produktgruppe: Buch, 1.13 kg, Verkaufsrang: 3351194, Datenbanken, Computer & Internet, Kategorien, Bücher,… Plus…
Polynomial Algorithms in Computer Algebra (Texts and mongraphs in symbolic computation) - Première édition
2013, ISBN: 9783211827598
Livres de poche
Springer, Taschenbuch, Auflage: 1. 270 Seiten, Publiziert: 2013-10-04T00:00:01Z, Produktgruppe: Buch, 1.13 kg, Verkaufsrang: 3351194, Datenbanken, Computer & Internet, Kategorien, Bücher,… Plus…
Polynomial Algorithms in Computer Algebra (Texts and mongraphs in symbolic computation) - Première édition
2013, ISBN: 9783211827598
Livres de poche
Springer, Taschenbuch, Auflage: 1. 270 Seiten, Publiziert: 2013-10-04T00:00:01Z, Produktgruppe: Buch, 1.13 kg, Verkaufsrang: 3351194, Datenbanken, Computer & Internet, Kategorien, Bücher,… Plus…
Données bibliographiques du meilleur livre correspondant
Informations détaillées sur le livre - Polynomial Algorithms in Computer Algebra Franz Winkler Author
EAN (ISBN-13): 9783211827598
ISBN (ISBN-10): 3211827595
Livre de poche
Date de parution: 1996
Editeur: Springer Vienna Core >1 >T
288 Pages
Poids: 0,544 kg
Langue: eng/Englisch
Livre dans la base de données depuis 2007-10-26T07:11:54+02:00 (Paris)
Page de détail modifiée en dernier sur 2024-02-18T21:19:18+01:00 (Paris)
ISBN/EAN: 9783211827598
ISBN - Autres types d'écriture:
3-211-82759-5, 978-3-211-82759-8
Autres types d'écriture et termes associés:
Auteur du livre: franz winkler, buchberger
Titre du livre: polynomial algorithms computer algebra, before the computer, constantin, constantine
Données de l'éditeur
Auteur: Franz Winkler
Titre: Texts & Monographs in Symbolic Computation; Polynomial Algorithms in Computer Algebra
Editeur: Springer; Springer Wien
270 Pages
Date de parution: 1996-08-02
Vienna; AT
Poids: 1,130 kg
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
VIII, 270 p.
BC; Algebra; Hardcover, Softcover / Mathematik/Arithmetik, Algebra; Algebra; Verstehen; algebra; algorithm; algorithms; complexity; computer; computer algebra; computer science; data structures; algorithm analysis and problem complexity; Theory of Computation; Data Structures; Algorithm Analysis and Problem Complexity; Algorithms; Symbolic and Algebraic Manipulation; Algebra; Theory of Computation; Data Science; Algorithms; Symbolic and Algebraic Manipulation; Theoretische Informatik; Datenbanken; Algorithmen und Datenstrukturen; Mathematik für Informatiker; EA
1 Introduction.- 1.1 What is computer algebra?.- 1.2 Program systems in computer algebra.- 1.3 Algebraic preliminaries.- 1.4 Representation of algebraic structures.- 1.5 Measuring the complexity of algorithms.- 1.6 Bibliographic notes.- 2 Arithmetic in basic domains.- 2.1 Integers.- 2.2 Polynomials.- 2.3 Quotient fields.- 2.4 Algebraic extension fields.- 2.5 Finite fields.- 2.6 Bibliographic notes.- 3 Computing by homomorphic images.- 3.1 The Chinese remainder problem and the modular method.- 3.2 p-adic approximation.- 3.3 The fast Fourier transform.- 3.4 Bibliographic notes.- 4 Greatest common divisors of polynomials.- 4.1 Polynomial remainder sequences.- 4.2 A modular gcd algorithm.- 4.3 Computation of resultants.- 4.4 Squarefree factorization.- 4.5 Squarefree partial fraction decomposition.- 4.6 Integration of rational functions.- 4.7 Bibliographic notes.- 5 Factorization of polynomials.- 5.1 Factorization over finite fields.- 5.2 Factorization over the integers.- 5.3 A polynomial-time factorization algorithm over the integers.- 5.4 Factorization over algebraic extension fields.- 5.5 Factorization over an algebraically closed field.- 5.6 Bibliographic notes.- 6 Decomposition of polynomials.- 6.1 A polynomial-time algorithm for decomposition.- 6.2 Bibliographic notes.- 7 Linear algebra—solving linear systems.- 7.1 Bareiss’s algorithm.- 7.2 Hankel matrices.- 7.3 Application of Hankel matrices to polynomial problems.- 7.4 Bibliographic notes.- 8 The method of Gröbner bases.- 8.1 Reduction relations.- 8.2 Polynomial reduction and Gröbner bases.- 8.3 Computation of Gröbner bases.- 8.4 Applications of Gröbner bases.- 8.5 Speed-ups and complexity considerations.- 8.6 Bibliographic notes.- 9 Quantifier elimination in real closed fields.- 9.1 The problem of quantifier elimination.- 9.2 Cylindrical algebraic decomposition.- 9.3 Bibliographic notes.- 10 Indefinite summation.- 10.1 Gosper’s algorithm.- 10.2 Bibliographic notes.- 11 Parametrization of algebraic curves.- 11.1 Plane algebraic curves.- 11.2 A parametrization algorithm.- 11.3 Bibliographic notes.- Solutions of selected exercises.- References.Autres livres qui pourraient ressembler au livre recherché:
Dernier livre similaire:
9783709165713 Polynomial Algorithms in Computer Algebra (Franz Winkler)
< pour archiver...