Algorithms for Computer Algebra
1992
854 citations
Keywords
Algebra over a fieldComputer scienceMathematicsPure mathematics
Affiliated Institutions
Related Publications
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed to be able to simulate any physical computing device with an incr...
Communication and Concurrency
Foreword. 1. Modelling Communication. 2. Basic Definitions. 3. Equational laws and Their Application. 4. Strong Bisimulation and Strong Equivalence. 5. Bisimulation and Observat...
Oracle Quantum Computing
Abstract Building on the work of Deutsch and Jozsa, we construct oracles relative to which (1) there is a decision problem that can be solved with certainty in worst-case polyno...
Publication Info
- Year
- 1992
- Type
- book
- Citations
- 854
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
854
OpenAlex
Cite This
K. O. Geddes,
S. R. Czapor,
George Labahn
(1992).
Algorithms for Computer Algebra.
.
https://doi.org/10.1007/b102438
Identifiers
- DOI
- 10.1007/b102438