Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Online-Ressource
    Online-Ressource
    Berlin u.a. : Springer
    UID:
    b3kat_BV035987946
    Umfang: 1 Online-Ressource (XI, 396 S.)
    ISBN: 354013350X , 038713350X
    Serie: Lecture notes in computer science 174
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Computeralgebra ; Datenverarbeitung ; Symbolischer Kalkül ; Berechenbarkeit ; Algorithmus ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    UID:
    gbv_595131468
    Umfang: Online-Ressource (XI, 396 S.)
    Ausgabe: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540388937
    Serie: Lecture notes in computer science 174
    Inhalt: Homogeneous linear difference equation (Frobenius — Boole method) -- An experiment toward a general quadrature for second order linear ordinary differential equations by symbolic computation -- Operational calculus techniques for solving differential equations -- On the application of symbolic computation to nonlinear control theory -- Quartic equations and algorithms for riemann tensor classification -- Symbolic computation and the Dirichlet problem -- Simplification of polynomials in n variables -- On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems -- Implementation of a p-adic package for polynomial factorization and other related operations -- Computations on curves -- Detecting torsion divisors on curves of genus 2 -- Computation in radical extensions -- A primer: 11 Keys to new scratchpad -- A pure and really simple initial functional algebraic language -- Some effectivity problems in polynomial ideal theory -- Upper and lower bounds for the degree of Groebner bases -- On the complexity of the Gröbner-bases algorithm over K[x,y,z] -- Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings -- Computations with rational subsets of confluent groups -- Camac2: A portable system for combinatorial and algebraic computation -- Polynomial time algorithms for Galois groups -- Code generation and optimization for finite element analysis -- A comparison of algorithms for the symbolic computation of Padé approximants -- Automatic error cumulation control -- Polynomial factorization by root approximation -- Effective Hilbert irreducibility -- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation -- A new lifting process for the multivariate polynomial factorization -- Explicit construction of the hilbert class fields of imaginary quadratic fields with class numbers 7 and 11 -- On a simple primality testing algorithm -- A criterion for the equivalence of two ideals -- y?+fy=g -- Integration in finite terms with special functions: A progress report -- A note on the Risch differential equation -- Approximation by continued fraction of a polynomial real root -- On the automatic resolution of certain diophantine equations -- On pseudo-resultants.
    Anmerkung: Literaturangaben
    Weitere Ausg.: ISBN 354013350X
    Weitere Ausg.: ISBN 038713350X
    Weitere Ausg.: ISBN 9783540133506
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe EUROSAM (3 : 1984 : Cambridge) EUROSAM 84 Berlin : Springer, 1984 ISBN 354013350X
    Weitere Ausg.: ISBN 038713350X
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Buch
    Buch
    Berlin [u.a.] :Springer,
    UID:
    almafu_BV000199451
    Umfang: XI, 396 S.
    ISBN: 3-540-13350-X , 0-387-13350-X
    Serie: Lecture notes in computer science 174
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Computeralgebra ; Datenverarbeitung ; Symbolischer Kalkül ; Berechenbarkeit ; Algorithmus ; Konferenzschrift ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    UID:
    almahu_9947920865302882
    Umfang: XI, 397 p. , online resource.
    ISBN: 9783540388937
    Serie: Lecture Notes in Computer Science, 174
    Anmerkung: Homogeneous linear difference equation (Frobenius — Boole method) -- An experiment toward a general quadrature for second order linear ordinary differential equations by symbolic computation -- Operational calculus techniques for solving differential equations -- On the application of symbolic computation to nonlinear control theory -- Quartic equations and algorithms for riemann tensor classification -- Symbolic computation and the Dirichlet problem -- Simplification of polynomials in n variables -- On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems -- Implementation of a p-adic package for polynomial factorization and other related operations -- Computations on curves -- Detecting torsion divisors on curves of genus 2 -- Computation in radical extensions -- A primer: 11 Keys to new scratchpad -- A pure and really simple initial functional algebraic language -- Some effectivity problems in polynomial ideal theory -- Upper and lower bounds for the degree of Groebner bases -- On the complexity of the Gröbner-bases algorithm over K[x,y,z] -- Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings -- Computations with rational subsets of confluent groups -- Camac2: A portable system for combinatorial and algebraic computation -- Polynomial time algorithms for Galois groups -- Code generation and optimization for finite element analysis -- A comparison of algorithms for the symbolic computation of Padé approximants -- Automatic error cumulation control -- Polynomial factorization by root approximation -- Effective Hilbert irreducibility -- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation -- A new lifting process for the multivariate polynomial factorization -- Explicit construction of the hilbert class fields of imaginary quadratic fields with class numbers 7 and 11 -- On a simple primality testing algorithm -- A criterion for the equivalence of two ideals -- y?+fy=g -- Integration in finite terms with special functions: A progress report -- A note on the Risch differential equation -- Approximation by continued fraction of a polynomial real root -- On the automatic resolution of certain diophantine equations -- On pseudo-resultants.
    In: Springer eBooks
    Weitere Ausg.: Printed edition: ISBN 9783540133506
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    UID:
    almahu_9948621331702882
    Umfang: XI, 397 p. , online resource.
    Ausgabe: 1st ed. 1984.
    ISBN: 9783540388937
    Serie: Lecture Notes in Computer Science, 174
    Anmerkung: Homogeneous linear difference equation (Frobenius - Boole method) -- An experiment toward a general quadrature for second order linear ordinary differential equations by symbolic computation -- Operational calculus techniques for solving differential equations -- On the application of symbolic computation to nonlinear control theory -- Quartic equations and algorithms for riemann tensor classification -- Symbolic computation and the Dirichlet problem -- Simplification of polynomials in n variables -- On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems -- Implementation of a p-adic package for polynomial factorization and other related operations -- Computations on curves -- Detecting torsion divisors on curves of genus 2 -- Computation in radical extensions -- A primer: 11 Keys to new scratchpad -- A pure and really simple initial functional algebraic language -- Some effectivity problems in polynomial ideal theory -- Upper and lower bounds for the degree of Groebner bases -- On the complexity of the Gröbner-bases algorithm over K[x,y,z] -- Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings -- Computations with rational subsets of confluent groups -- Camac2: A portable system for combinatorial and algebraic computation -- Polynomial time algorithms for Galois groups -- Code generation and optimization for finite element analysis -- A comparison of algorithms for the symbolic computation of Padé approximants -- Automatic error cumulation control -- Polynomial factorization by root approximation -- Effective Hilbert irreducibility -- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation -- A new lifting process for the multivariate polynomial factorization -- Explicit construction of the hilbert class fields of imaginary quadratic fields with class numbers 7 and 11 -- On a simple primality testing algorithm -- A criterion for the equivalence of two ideals -- y?+fy=g -- Integration in finite terms with special functions: A progress report -- A note on the Risch differential equation -- Approximation by continued fraction of a polynomial real root -- On the automatic resolution of certain diophantine equations -- On pseudo-resultants.
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783662172995
    Weitere Ausg.: Printed edition: ISBN 9783540133506
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Online-Ressource
    Online-Ressource
    Berlin, Heidelberg : Springer Berlin Heidelberg
    UID:
    gbv_1649201850
    Umfang: Online-Ressource
    ISBN: 9783540388937
    Serie: Lecture Notes in Computer Science 174
    Weitere Ausg.: ISBN 9783540133506
    Weitere Ausg.: Buchausg. u.d.T. EUROSAM (3 : 1984 : Cambridge) EUROSAM 84 Berlin : Springer, 1984 ISBN 354013350X
    Weitere Ausg.: ISBN 038713350X
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    URL: Cover
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Buch
    Buch
    Berlin [u.a.] : Springer
    UID:
    b3kat_BV000199451
    Umfang: XI, 396 S.
    ISBN: 354013350X , 038713350X
    Serie: Lecture notes in computer science 174
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Computeralgebra ; Datenverarbeitung ; Symbolischer Kalkül ; Berechenbarkeit ; Algorithmus ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Online-Ressource
    Online-Ressource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    edocfu_9959186271102883
    Umfang: 1 online resource (XI, 397 p.)
    Ausgabe: 1st ed. 1984.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-38893-1
    Serie: Lecture Notes in Computer Science, 174
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Homogeneous linear difference equation (Frobenius — Boole method) -- An experiment toward a general quadrature for second order linear ordinary differential equations by symbolic computation -- Operational calculus techniques for solving differential equations -- On the application of symbolic computation to nonlinear control theory -- Quartic equations and algorithms for riemann tensor classification -- Symbolic computation and the Dirichlet problem -- Simplification of polynomials in n variables -- On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems -- Implementation of a p-adic package for polynomial factorization and other related operations -- Computations on curves -- Detecting torsion divisors on curves of genus 2 -- Computation in radical extensions -- A primer: 11 Keys to new scratchpad -- A pure and really simple initial functional algebraic language -- Some effectivity problems in polynomial ideal theory -- Upper and lower bounds for the degree of Groebner bases -- On the complexity of the Gröbner-bases algorithm over K[x,y,z] -- Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings -- Computations with rational subsets of confluent groups -- Camac2: A portable system for combinatorial and algebraic computation -- Polynomial time algorithms for Galois groups -- Code generation and optimization for finite element analysis -- A comparison of algorithms for the symbolic computation of Padé approximants -- Automatic error cumulation control -- Polynomial factorization by root approximation -- Effective Hilbert irreducibility -- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation -- A new lifting process for the multivariate polynomial factorization -- Explicit construction of the hilbert class fields of imaginary quadratic fields with class numbers 7 and 11 -- On a simple primality testing algorithm -- A criterion for the equivalence of two ideals -- y?+fy=g -- Integration in finite terms with special functions: A progress report -- A note on the Risch differential equation -- Approximation by continued fraction of a polynomial real root -- On the automatic resolution of certain diophantine equations -- On pseudo-resultants. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-13350-X
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Online-Ressource
    Online-Ressource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    edoccha_9959186271102883
    Umfang: 1 online resource (XI, 397 p.)
    Ausgabe: 1st ed. 1984.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-38893-1
    Serie: Lecture Notes in Computer Science, 174
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Homogeneous linear difference equation (Frobenius — Boole method) -- An experiment toward a general quadrature for second order linear ordinary differential equations by symbolic computation -- Operational calculus techniques for solving differential equations -- On the application of symbolic computation to nonlinear control theory -- Quartic equations and algorithms for riemann tensor classification -- Symbolic computation and the Dirichlet problem -- Simplification of polynomials in n variables -- On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems -- Implementation of a p-adic package for polynomial factorization and other related operations -- Computations on curves -- Detecting torsion divisors on curves of genus 2 -- Computation in radical extensions -- A primer: 11 Keys to new scratchpad -- A pure and really simple initial functional algebraic language -- Some effectivity problems in polynomial ideal theory -- Upper and lower bounds for the degree of Groebner bases -- On the complexity of the Gröbner-bases algorithm over K[x,y,z] -- Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings -- Computations with rational subsets of confluent groups -- Camac2: A portable system for combinatorial and algebraic computation -- Polynomial time algorithms for Galois groups -- Code generation and optimization for finite element analysis -- A comparison of algorithms for the symbolic computation of Padé approximants -- Automatic error cumulation control -- Polynomial factorization by root approximation -- Effective Hilbert irreducibility -- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation -- A new lifting process for the multivariate polynomial factorization -- Explicit construction of the hilbert class fields of imaginary quadratic fields with class numbers 7 and 11 -- On a simple primality testing algorithm -- A criterion for the equivalence of two ideals -- y?+fy=g -- Integration in finite terms with special functions: A progress report -- A note on the Risch differential equation -- Approximation by continued fraction of a polynomial real root -- On the automatic resolution of certain diophantine equations -- On pseudo-resultants. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-13350-X
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    UID:
    gbv_022190570
    Umfang: XI, 396 S. , graph. Darst.
    ISBN: 354013350X , 038713350X
    Serie: Lecture notes in computer science 174
    Anmerkung: Literaturangaben
    Weitere Ausg.: Online-Ausg. EUROSAM (3 : 1984 : Cambridge) EUROSAM 84 Berlin [u.a.] : Springer, 1984 ISBN 9783540388937
    Weitere Ausg.: Erscheint auch als Online-Ausgabe Fitch, J. EUROSAM 84 Berlin, Heidelberg : Springer Berlin Heidelberg, 1984 ISBN 9783540388937
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Konferenzschrift
    URL: Cover
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz