Search
for Topics
All Reviews
Browse All Reviews
>
Computing Methodologies (I)
>
Symbolic and Algebraic Manipulation (I.1)
>
Algorithms (I.1.2)
> Algebraic Algorithms (I.1.2...)
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
110 of 69 Reviews about "
Algebraic Algorithms (I.1.2...)
":
Date Reviewed
Complexity estimates for two uncoupling algorithms
Bostan A., Chyzak F., de Panafieu É. ISSAC 2013 (Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, Boston, ME, Jun 2629, 2013) 8592, 2013. Type: Proceedings
Uncoupling is the process of producing one (or several uncoupled) equivalent higherorder differential equation(s) from a matrix of firstorder (coupled) differential equations
Y’
=
MY
, whe...
Feb 21 2014
Dijkstra, Floyd and Warshall meet Kleene
Höfner P., Möller B. Formal Aspects of Computing 24(46): 459476, 2012. Type: Article
We have recently seen quite a resurgence of interest in semirings and related algebraic structures. While mathematicians have known about these structures for a long time, as with monoids, they have not received much attention. They do...
Nov 13 2013
Algebraic transformation of differential characteristic decompositions from one ranking to another
Golubitsky O., Kondratieva M., Ovchinnikov A. Journal of Symbolic Computation 44(4): 333357, 2009. Type: Article
The problem of efficiently transforming differential sets from one ranking to another is studied in this paper. The major advantage of the authors’ approach over other approaches is the fact that the most timeconsuming part ...
Nov 10 2009
State space analysis of Petri nets with relationalgebraic methods
Fronk A., Kehden B. Journal of Symbolic Computation 44(1): 1547, 2009. Type: Article
This paper describes the applicability of relationalgebraic methods to state space analysis of Petri nets. It provides an indepth summary of relationalgebraic methodsan area in which the authors, particularly Fronk, have ...
Mar 30 2009
Gröbner bases for public key cryptography
Caboara M., Caruso F., Traverso C. Symbolic and algebraic computation (Proceedings of the Twentyfirst International Symposium on Symbolic and Algebraic Computation, Linz/Hagenberg, Austria, Jul 2023, 2008) 315324, 2008. Type: Proceedings, Reviews: (2 of 2)
The pseudonymous authors of an earlier paper [1] purport to show “why you cannot even hope to use Gröbner bases in cryptography,” although what they show, in fact, is that a particular scheme, often referre...
Nov 27 2008
Gröbner bases for public key cryptography
Caboara M., Caruso F., Traverso C. Symbolic and algebraic computation (Proceedings of the Twentyfirst International Symposium on Symbolic and Algebraic Computation, Linz/Hagenberg, Austria, Jul 2023, 2008) 315324, 2008. Type: Proceedings, Reviews: (1 of 2)
The computation of Gröbner bases is a difficult task often encountered in cryptanalysis, the destructive aspect of cryptology. As a general rule, such difficult tasks can be reused constructively, as foundations for new crypto...
Sep 30 2008
Real root isolation for explog functions
Strzebonski A. Symbolic and algebraic computation (Proceedings of the Twentyfirst International Symposium on Symbolic and Algebraic Computation, Linz/Hagenberg, Austria, Jul 2023, 2008) 303314, 2008. Type: Proceedings
Explog functions
f
are, roughly speaking, built up from polynomials by algebraic operations, exponentiation, and taking logarithms; therefore, they include reciprocals and radicals. This paper is concerned with root...
Sep 11 2008
Efficient algorithm for computing the EulerPoincaré characteristic of a semialgebraic set defined by few quadratic inequalities
Basu S. Computational Complexity 15(3): 236251, 2006. Type: Article
In recent years, there has been a strong effort in computational real algebraic geometry to provide algorithms (and corresponding complexity estimates) for determining the geometric and topological properties of semialgebraic sets, nam...
Jul 31 2007
Modern computer algebra
von zur Gathen J., Gerhard J., Cambridge University Press, New York, NY, 2003. 800 pp. Type: Book (9780521826464)
This is the second edition of a comprehensive textbook on the mathematical and algorithmic foundations of computer algebra. This edition is similar to the first edition [1], with corrections and some changes to chapters 3, 15, and 22. ...
Dec 21 2004
Computer algebra systems
Grabmeier J., Kaltofen E., Weispfenning V. In
Computer algebra handbook
. New York, NY: SpringerVerlag New York, Inc., 2003. Type: Book Chapter
This chapter coversin a very complete, exhaustive, clear, and comprehensive waythe stateoftheart in computer algebra systems....
Jun 22 2004
Display
5
10
15
25
50
100
per page
Reproduction in whole or in part without permission is prohibited. Copyright 19992023 ThinkLoud
^{®}
Terms of Use

Privacy Policy