|
|
|
|
|
|
Date Reviewed |
|
|
1 - 10 of 16
reviews
|
|
|
|
|
|
|
|
Exact geometric-topological analysis of algebraic surfaces Berberich E., Kerber M., Sagraloff M. Computational geometry (Proceedings of the Twenty-fourth Annual Symposium on Computational Geometry, College Park, MD, Jun 9-11, 2008) 164-173, 2008. Type: Proceedings
Berberich et al. introduce an algorithm for computing the topology of a surface in three-dimensional (3D) space, implicitly represented by a polynomial in three unknowns of arbitrary degree N. For any given polynomia...
|
Oct 6 2008 |
|
|
|
|
|
|
Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities Basu S. Computational Complexity 15(3): 236-251, 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 |
|
|
|
|
|
|
Algebraic conditions for classifying the positional relationships between two conics and their applications Liu Y., Chen F. Journal of Computer Science and Technology 19(5): 665-673, 2004. Type: Article
Following the ideas of Wang et al. [1], this paper presents several techniques from computer algebra (mainly resultants) to characterize the relative position between two conics. This relative position is described in terms of the root...
|
Mar 16 2005 |
|
|
|
|
|
|
Computer algebra systems Grabmeier J., Kaltofen E., Weispfenning V. In Computer algebra handbook. New York, NY: Springer-Verlag New York, Inc., 2003. Type: Book Chapter
This chapter covers--in a very complete, exhaustive, clear, and comprehensive way--the state-of-the-art in computer algebra systems....
|
Jun 22 2004 |
|
|
|
|
|
|
Dense resultant of composed polynomials mixed-mixed case Minimair M. Journal of Symbolic Computation 36(6): 825-834, 2003. Type: Article
This paper is devoted to solving the following problem: how to represent the multivariate dense (Macaulay) resultant of a composed polynomial family in terms of the resultants of the two families involved in the composition....
|
Apr 1 2004 |
|
|
|
|
|
|
Fraction-free row reduction of matrices of skew polynomials Beckermann B., Cheng H., Labahn G. Symbolic and algebraic computation (Proceedings of the 2002 international symposium, Lille, France, Jul 7-10, 2002) 8-15, 2002. Type: Proceedings
Skew polynomials are very useful in symbolic computation and algebra to uniformly model problems involving differential or difference operators. This paper is devoted to introducing a new algorithm, computing the row reduction of a mat...
|
Jan 15 2004 |
|
|
|
|
|
|
Fast construction of irreducible polynomials over finite fields Shoup V. Journal of Symbolic Computation 17(5): 371-391, 1994. Type: Article
A new probabilistic algorithm for constructing an irreducible polynomial of degree n over a finite field &FF; q with q elements is presented. This important mathem...
|
Sep 1 1995 |
|
|
|
|
|
|
Inverting polynomials and formal power series Kalorkoti K. SIAM Journal on Computing 22(3): 552-559, 1993. Type: Article
The upper and lower bounds for the nonscalar complexity of computing the coefficients z 0 , z 1 ,... of the formal power series associated with the inverse of a general polynomial of degree
|
Jul 1 1994 |
|
|
|
|
|
|
Introduction to Maple Heck A., Springer-Verlag New York, Inc., New York, NY, 1993. Type: Book (9780387976624)
In addition to Maple, this book introduces computer algebra. Chapter 1 is devoted to this purpose, and the rest of the chapters implicitly contain many of the problems and techniques involved in this new discipline in computational ma...
|
Jun 1 1994 |
|
|
|
|
|
|
A reliable method for solving nonlinear systems of equations of few variables Kálovics F. Computing 48(3-4): 291-302, 1992. Type: Article
The author presents a new method of solving nonlinear systems of equations in a compact m -dimensional interval by using the notions of indicator functions and cover systems. If the system to be solved inside the
|
Sep 1 1993 |
|
|
|
|
|
|
|
|
|
|
|