Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISSAC 1998: Rostock, Germany
- Volker Weispfenning, Barry M. Trager:
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC '98, Rostock, Germany, August 13-15, 1998. ACM 1998, ISBN 1-58113-002-3 - Tateaki Sasaki, Satoshi Yamaguchi:
An Analysis of Cancellation Error in Multivariate Hensel Construction with Floating-Point Number Arithmetic. 1-8 - Hans J. Stetter, Günther H. Thallinger:
Singular Systems of Polynomials. 9-16 - Dima Grigoriev, Anatol Slissenko:
Polytime Algorithm for the Shortest Path in a Homotopy Class Amidst Semi-Algebraic Obstacles in the Plane. 17-24 - Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set. 25-29 - Angel Díaz, Erich L. Kaltofen:
FOXBOX: A System for Manipulating Symbolic Objects in Black Box Representation. 30-37 - Thomas Breuer, Steve Linton:
The GAP 4 Type System: Organising Algebraic Algorithms. 38-45 - Yagati N. Lakshman, Bruce W. Char, Jeremy Johnson:
Software Components Using Symbolic Computation for Problem Solving Environments. 46-53 - Samuel S. Dooley:
Coordinating Mathematical Content and Presentation Markup in Interactive Mathematical Documents. 54-61 - Pietro Iglio, Giuseppe Attardi:
Software Components for Computer Algebra. 62-69 - Igor E. Poloskov
:
Compound Program Packages and a Nonlinear Random Fluctuations Analysis. 70-75 - Akmal A. Vakhidov, Irina V. Tupikova:
Application of Computer Algebra Methods to the Construction of an Asteroid Motion Theory Based on Lie Transforms. 76-79 - Martin Dunstan, Tom Kelsey, Steve Linton, Ursula Martin:
Lightweight Formal Methods for Computer Algebra Systems. 80-87 - Andreas Dolzmann, Oliver Gloor, Thomas Sturm:
Approaches to Parallel Quantifier Elimination. 88-95 - Laurent Bernardin:
On Bivariate Hensel and Its Parallelization. 96-100 - Arne Storjohann:
An O(n3) Algorithm for the Frobenius Normal Form. 101-105 - Thom Mulders, Arne Storjohann:
The Modulo N Extended GCD Problem for Polynomials. 105-112 - Mark Giesbrecht, Austin Lobo, B. David Saunders:
Certifying Inconsistency of Sparse Linear Systems. 113-119 - Mark van Hoeij:
Rational Solutions of Linear Difference Equations. 120-123 - Sergei A. Abramov, Moulay A. Barkatou:
Rational Solutions of First Order Linear Difference Systems. 124-131 - Ziming Li:
A Subresultant Theory for Ore Polynomials with Applications. 132-139 - Patrik Nordbeck:
Canonical Subalgebraic Bases in Non-Commutative Polynomial Rings. 140-146 - Massimo Caboara, Carlo Traverso:
Efficient Algorithms for Ideal Operations (extended abstract). 147-152 - Jörn Müller-Quade, Martin Rötteler:
Deciding Linear Disjointness of Finitely Generated Fields. 153-160 - R. Nörenberg:
Covering Nonomial Algebras. 161-164 - Charles C. Sims:
Fast Multiplication and Growth in Groups. 165-170 - Birgit Reinert, Klaus Madlener, Teo Mora:
A Note on Nielsen Reduction and Coset Enumeration. 171-178 - Jürgen Müller:
The 5-Modular Decomposition Matrix of the Sporadic Simple Conway Group Co3. 179-185 - Sebastian Egner, Markus Püschel:
Solving Puzzles Related to Permutation Groups. 186-193 - Alexander Hulpke:
Computing Normal Subgroups. 194-198 - V. Kislenkov, V. Mitrofanov, Eugene V. Zima:
Multidimensional Chains of Recurrences. 199-206 - Evgenija D. Popova, Christian P. Ullrich:
Simplication of Symbolic-Numerical Interval Expressions. 207-214 - Aude Maignan:
Solving One and Two-Dimensional Exponential Polynomial Systems. 215-221 - Frédéric Beringer, Françoise Jung:
Solving "Generalized Algebraic Equations". 222-227 - Paulina Chin, Robert M. Corless, George F. Corliss:
Optimization Strategies for the Approximate GCD Problem. 228-235 - Markus A. Hitz, Erich L. Kaltofen:
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots. 236-243 - Aaron S. Wallack, Ioannis Z. Emiris, Dinesh Manocha:
MARS: A MAPLE/MATLAB/C Resultant-Based Solver. 244-251 - Didier Bondyfalat, Bernard Mourrain, Victor Y. Pan:
Controlled Iterative Methods for Solving Polynomial Systems. 252-259 - Peter Kirrinnis:
Fast Numerical Improvement of Factors of Polynomials and of Partial Fractions. 260-267 - Moulay A. Barkatou, Eckhard Pflügel:
On the Equivalence Problem of Linear Differential Systems and Its Application for Factoring Completely Reducible Systems. 268-275 - Vincel Hoang Ngoc Minh, Michel Petitot, Joris van der Hoeven:
Computation of the Monodromy of Generalized Polylogarithms. 276-283 - Jürgen Gerhard:
High Degree Solutions of Low Degree Equations (extended abstract). 284-289 - David J. Jeffrey, Albert D. Rich:
Recursive Integration of Piecewise-Continuous Functions. 290-294 - Christopher W. Brown:
Simplification of Truth-Invariant Cylindrical Algebraic Decompositions. 295-301 - Josef Schicho:
Rational Parametrization of Real Algebraic Surfaces. 302-308 - Olaf Bachmann, Hans Schönemann:
Monomial Representations for Gröbner Bases Computations. 309-316 - Yosuke Sato:
A New Type of Canonical Gröbner Bases in Polynomial Rings over Von Neumann Regular Rings. 317-321
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
