Skip header Section
Skip Bibliometrics Section
Computer algebra handbookJanuary 2003
Abstract
No abstract available.
Cited By
- Kahl K and Kintscher N (2020). Automated local Fourier analysis (aLFA), BIT, 60:3, (651-686), Online publication date: 1-Sep-2020.
- Baydin A, Pearlmutter B, Radul A and Siskind J (2017). Automatic differentiation in machine learning, The Journal of Machine Learning Research, 18:1, (5595-5637), Online publication date: 1-Jan-2017.
- Behrends R, Hammond K, Janjic V, Konovalov A, Linton S, Loidl H, Maier P and Trinder P (2016). HPC-GAP, Concurrency and Computation: Practice & Experience, 28:13, (3606-3636), Online publication date: 10-Sep-2016.
- Ziegler K Tame decompositions and collisions Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, (421-428)
- Zhi L Symbolic-numeric algorithms for computing validated results Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, (25-26)
- Corless R, Postma E and Stoutemyer D GCD of multivariate approximate polynomials using beautification with the subtractive algorithm Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation, (153-154)
- Buchberger B and Rosenkranz M (2012). Transforming problems from analysis to algebra, Journal of Symbolic Computation, 47:6, (589-609), Online publication date: 1-Jun-2012.
- Knyazhansky M and Plotkin T (2012). Knowledge Bases Over Algebraic Models, International Journal of Knowledge Management, 8:1, (22-39), Online publication date: 1-Jan-2012.
- Kredel H and Jolly R Algebraic structures as typed objects Proceedings of the 13th international conference on Computer algebra in scientific computing, (294-308)
- Cai J, Chen X, Lipton R and Lu P On tractable exponential sums Proceedings of the 4th international conference on Frontiers in algorithmics, (148-159)
- von zur Gathen J The number of decomposable univariate polynomials. extended abstract Proceedings of the 2009 international symposium on Symbolic and algebraic computation, (359-366)
- Kredel H Unique factorization domains in the java computer algebra system Proceedings of the 7th international conference on Automated deduction in geometry, (86-115)
- Maza M and Xie Y Component-level parallelization of triangular decompositions Proceedings of the 2007 international workshop on Parallel symbolic computation, (69-77)
- Gopalakrishnan S, Kalla P, Meredith M and Enescu F Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design, (143-148)
- Kaltofen E and Zhi L Hybrid symbolic-numeric computation Proceedings of the 2006 international symposium on Symbolic and algebraic computation, (7-7)
- Kredel H On the design of a Java computer algebra system Proceedings of the 4th international symposium on Principles and practice of programming in Java, (143-152)
- Joyner D (2006). OSCAS, ACM Communications in Computer Algebra, 40:3-4, (108-111), Online publication date: 1-Sep-2006.
- Shekhar N, Kalla P and Enescu F Equivalence verification of arithmetic datapaths with multiple word-length operands Proceedings of the conference on Design, automation and test in Europe: Proceedings, (824-829)
- Mao W and Wu J Application of Wu's method to symbolic model checking Proceedings of the 2005 international symposium on Symbolic and algebraic computation, (237-244)
- Roanes-Lozano E, García R, Roanes-Macías E, Aparicio A and Laita L Meta-Petro Proceedings of the 8th international conference on Computer Algebra in Scientific Computing, (344-354)
- Ogita T, Rump S and Oishi S (2005). Accurate Sum and Dot Product, SIAM Journal on Scientific Computing, 26:6, (1955-1988), Online publication date: 1-Jan-2005.
- Carette J Understanding expression simplification Proceedings of the 2004 international symposium on Symbolic and algebraic computation, (72-79)
- Chrzastowski-Wachtel P and Tyszkiewicz J A maple package for conditional event algebras Proceedings of the 2002 international conference on Conditionals, Information, and Inference, (131-151)
Index Terms
- Computer algebra handbook
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Construction of quotient BCI(BCK)-algebra via a fuzzy ideal
The present paper gives a new construction of a quotient BCI(BCK)- algebra X/µ by a fuzzy ideal µ in X and establishes the Fuzzy Homomorphism Fundamental Theorem. We show that if µ is a fuzzy ideal (closed fuzzy ideal) of X. then X/µ is a commutative (...
Souslin algebra embeddings
AbstractA Souslin algebra is a complete Boolean algebra whose main features are ruled by a tight combination of an antichain condition with an infinite distributive law. The present article divides into two parts. In the first part a representation theory ...