Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Years
Subjects(RVK)
Access
  • 1
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almafu_9959186360602883
    Format: 1 online resource (XI, 117 p.)
    Edition: 1st ed. 1992.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47026-3
    Series Statement: Lecture Notes in Computer Science, 584
    Content: This book contains papers presented at a workshop on the use of parallel techniques in symbolic and algebraic computation held at Cornell University in May 1990. The eight papers in the book fall into three groups. The first three papers discuss particular programming substrates for parallel symbolic computation, especially for distributed memory machines. The next three papers discuss novel ways of computing with elements of finite fields and with algebraic numbers. The finite field technique is especially interesting since it uses the Connection Machine, a SIMD machine, to achievesurprising amounts of parallelism. One of the parallel computing substrates is also used to implement a real root isolation technique. One of the crucial algorithms in modern algebraic computation is computing the standard, or Gr|bner, basis of an ideal. The final two papers discuss two different approaches to speeding their computation. One uses vector processing on the Cray and achieves significant speed-ups. The other uses a distributed memory multiprocessor and effectively explores the trade-offs involved with different interconnect topologies of the multiprocessors.
    Note: Bibliographic Level Mode of Issuance: Monograph , The S-threads environment for parallel symbolic computation -- Algebraic computing on a local net -- An environment for parallel algebraic computation -- Finite field arithmetic using the connection machine -- Embarrassingly parallel algorithms for algebraic number arithmetic — and some less trivial issues -- Parallel real root isolation using the coefficient sign variation method -- Very large Gröbner basis calculations -- Boolean Gröbner bases and their MIMD implementation. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-55328-2
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    gbv_595127509
    Format: Online-Ressource (IX, 114 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540470267
    Series Statement: Lecture notes in computer science 584
    Content: The S-threads environment for parallel symbolic computation -- Algebraic computing on a local net -- An environment for parallel algebraic computation -- Finite field arithmetic using the connection machine -- Embarrassingly parallel algorithms for algebraic number arithmetic — and some less trivial issues -- Parallel real root isolation using the coefficient sign variation method -- Very large Gröbner basis calculations -- Boolean Gröbner bases and their MIMD implementation.
    Content: This book contains papers presented at a workshop on the use of parallel techniques in symbolic and algebraic computation held at Cornell University in May 1990. The eight papers in the book fall into three groups. The first three papers discuss particular programming substrates for parallel symbolic computation, especially for distributed memory machines. The next three papers discuss novel ways of computing with elements of finite fields and with algebraic numbers. The finite field technique is especially interesting since it uses the Connection Machine, a SIMD machine, to achievesurprising amounts of parallelism. One of the parallel computing substrates is also used to implement a real root isolation technique. One of the crucial algorithms in modern algebraic computation is computing the standard, or Gr/bner, basis of an ideal. The final two papers discuss two different approaches to speeding their computation. One uses vector processing on the Cray and achieves significant speed-ups. The other uses a distributed memory multiprocessor and effectively explores the trade-offs involved with different interconnect topologies of the multiprocessors.
    Note: Literaturangaben
    Additional Edition: ISBN 3540553282
    Additional Edition: ISBN 9783540553281
    Additional Edition: Erscheint auch als Druck-Ausgabe Computer algebra and parallelism Berlin : Springer, 1992 ISBN 3540553282
    Additional Edition: ISBN 0387553282
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Parallelverarbeitung ; Konferenzschrift ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almahu_9947920910002882
    Format: XI, 117 p. , online resource.
    ISBN: 9783540470267
    Series Statement: Lecture Notes in Computer Science, 584
    Content: This book contains papers presented at a workshop on the use of parallel techniques in symbolic and algebraic computation held at Cornell University in May 1990. The eight papers in the book fall into three groups. The first three papers discuss particular programming substrates for parallel symbolic computation, especially for distributed memory machines. The next three papers discuss novel ways of computing with elements of finite fields and with algebraic numbers. The finite field technique is especially interesting since it uses the Connection Machine, a SIMD machine, to achievesurprising amounts of parallelism. One of the parallel computing substrates is also used to implement a real root isolation technique. One of the crucial algorithms in modern algebraic computation is computing the standard, or Gr|bner, basis of an ideal. The final two papers discuss two different approaches to speeding their computation. One uses vector processing on the Cray and achieves significant speed-ups. The other uses a distributed memory multiprocessor and effectively explores the trade-offs involved with different interconnect topologies of the multiprocessors.
    Note: The S-threads environment for parallel symbolic computation -- Algebraic computing on a local net -- An environment for parallel algebraic computation -- Finite field arithmetic using the connection machine -- Embarrassingly parallel algorithms for algebraic number arithmetic — and some less trivial issues -- Parallel real root isolation using the coefficient sign variation method -- Very large Gröbner basis calculations -- Boolean Gröbner bases and their MIMD implementation.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540553281
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    almahu_9948621528002882
    Format: XI, 117 p. , online resource.
    Edition: 1st ed. 1992.
    ISBN: 9783540470267
    Series Statement: Lecture Notes in Computer Science, 584
    Content: This book contains papers presented at a workshop on the use of parallel techniques in symbolic and algebraic computation held at Cornell University in May 1990. The eight papers in the book fall into three groups. The first three papers discuss particular programming substrates for parallel symbolic computation, especially for distributed memory machines. The next three papers discuss novel ways of computing with elements of finite fields and with algebraic numbers. The finite field technique is especially interesting since it uses the Connection Machine, a SIMD machine, to achievesurprising amounts of parallelism. One of the parallel computing substrates is also used to implement a real root isolation technique. One of the crucial algorithms in modern algebraic computation is computing the standard, or Gr|bner, basis of an ideal. The final two papers discuss two different approaches to speeding their computation. One uses vector processing on the Cray and achieves significant speed-ups. The other uses a distributed memory multiprocessor and effectively explores the trade-offs involved with different interconnect topologies of the multiprocessors.
    Note: The S-threads environment for parallel symbolic computation -- Algebraic computing on a local net -- An environment for parallel algebraic computation -- Finite field arithmetic using the connection machine -- Embarrassingly parallel algorithms for algebraic number arithmetic - and some less trivial issues -- Parallel real root isolation using the coefficient sign variation method -- Very large Gröbner basis calculations -- Boolean Gröbner bases and their MIMD implementation.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662185346
    Additional Edition: Printed edition: ISBN 9783540553281
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    edoccha_9959186360602883
    Format: 1 online resource (XI, 117 p.)
    Edition: 1st ed. 1992.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47026-3
    Series Statement: Lecture Notes in Computer Science, 584
    Content: This book contains papers presented at a workshop on the use of parallel techniques in symbolic and algebraic computation held at Cornell University in May 1990. The eight papers in the book fall into three groups. The first three papers discuss particular programming substrates for parallel symbolic computation, especially for distributed memory machines. The next three papers discuss novel ways of computing with elements of finite fields and with algebraic numbers. The finite field technique is especially interesting since it uses the Connection Machine, a SIMD machine, to achievesurprising amounts of parallelism. One of the parallel computing substrates is also used to implement a real root isolation technique. One of the crucial algorithms in modern algebraic computation is computing the standard, or Gr|bner, basis of an ideal. The final two papers discuss two different approaches to speeding their computation. One uses vector processing on the Cray and achieves significant speed-ups. The other uses a distributed memory multiprocessor and effectively explores the trade-offs involved with different interconnect topologies of the multiprocessors.
    Note: Bibliographic Level Mode of Issuance: Monograph , The S-threads environment for parallel symbolic computation -- Algebraic computing on a local net -- An environment for parallel algebraic computation -- Finite field arithmetic using the connection machine -- Embarrassingly parallel algorithms for algebraic number arithmetic — and some less trivial issues -- Parallel real root isolation using the coefficient sign variation method -- Very large Gröbner basis calculations -- Boolean Gröbner bases and their MIMD implementation. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-55328-2
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    edocfu_9959186360602883
    Format: 1 online resource (XI, 117 p.)
    Edition: 1st ed. 1992.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47026-3
    Series Statement: Lecture Notes in Computer Science, 584
    Content: This book contains papers presented at a workshop on the use of parallel techniques in symbolic and algebraic computation held at Cornell University in May 1990. The eight papers in the book fall into three groups. The first three papers discuss particular programming substrates for parallel symbolic computation, especially for distributed memory machines. The next three papers discuss novel ways of computing with elements of finite fields and with algebraic numbers. The finite field technique is especially interesting since it uses the Connection Machine, a SIMD machine, to achievesurprising amounts of parallelism. One of the parallel computing substrates is also used to implement a real root isolation technique. One of the crucial algorithms in modern algebraic computation is computing the standard, or Gr|bner, basis of an ideal. The final two papers discuss two different approaches to speeding their computation. One uses vector processing on the Cray and achieves significant speed-ups. The other uses a distributed memory multiprocessor and effectively explores the trade-offs involved with different interconnect topologies of the multiprocessors.
    Note: Bibliographic Level Mode of Issuance: Monograph , The S-threads environment for parallel symbolic computation -- Algebraic computing on a local net -- An environment for parallel algebraic computation -- Finite field arithmetic using the connection machine -- Embarrassingly parallel algorithms for algebraic number arithmetic — and some less trivial issues -- Parallel real root isolation using the coefficient sign variation method -- Very large Gröbner basis calculations -- Boolean Gröbner bases and their MIMD implementation. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-55328-2
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783504470227?
Did you mean 9783504470265?
Did you mean 9783540300267?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages