default search action
9th CASC 2006: Chisinau, Moldova
- Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov:
Computer Algebra in Scientific Computing, 9th International Workshop, CASC 2006, Chisinau, Moldova, September 11-15, 2006, Proceedings. Lecture Notes in Computer Science 4194, Springer 2006, ISBN 3-540-45182-X - Víctor Álvarez, José Andrés Armario, María Dolores Frau, Pedro Real:
Comparison Maps for Relatively Free Resolutions. 1-22 - I. N. Belyaeva, Nikolai A. Chekanov, Alexander Gusev, Vitaly Rostovtsev, Sergey I. Vinitsky:
A Symbolic-Numeric Approach for Solving the Eigenvalue Problem for the One-Dimensional Schrödinger Equation. 23-32 - Ainhoa Berciano, María José Jiménez, Pedro Real:
Reducing Computational Costs in the Basic Perturbation Lemma. 33-48 - Rudolf Berghammer:
Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView. 49-63 - Marco Bodrato, Alberto Zanoni:
Intervals, Syzygies, Numerical Gröbner Bases: A Mixed Study. 64-76 - V. P. Borunov, Yu. A. Ryabov, O. V. Surkov:
Application of Computer Algebra for Construction of Quasi-periodic Solutions for Restricted Circular Planar Three Body Problem. 77-88 - Christopher W. Brown, Christian Gross:
Efficient Preprocessing Methods for Quantifier Elimination. 89-100 - A. Casian, R. Dusciac, V. Dusciac, V. Patsiuk:
Symbolic and Numerical Calculation of Transport Integrals for Some Organic Crystals. 101-108 - Dmytro Chibisov, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov:
On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions. 109-128 - Svetlana Cojocaru, Ludmila Malahova, Alexander Colesnicov:
Providing Modern Software Environments to Computer Algebra Systems. 129-140 - D. M. Diarova, N. I. Zemtsova:
The Instability of the Rhombus-Like Central Configurations in Newton 9-Body Problem. 141-148 - Jesús Gago-Vargas, María Isabel Hartillo-Hermoso, José María Ucha-Enríquez:
Algorithmic Invariants for Alexander Modules. 149-154 - Jesús Gago-Vargas, María Isabel Hartillo-Hermoso, Jorge Martín-Morales, José María Ucha-Enríquez:
Sudokus and Gröbner Bases: Not Only a Divertimento. 155-165 - Rocío González-Díaz, Belén Medrano, Javier Sánchez-Peláez, Pedro Real:
Simplicial Perturbation Techniques and Effective Homology. 166-177 - E. A. Grebenicov, Dorota Kozak-Skoworodkin, D. M. Diarova:
Numerical Study of Stability Domains of Hamiltonian Equation Solutions. 178-191 - Evgenii A. Grebenikov, Ersain V. Ikhsanov, Alexander N. Prokopenya:
Numeric-Symbolic Computations in the Study of Central Configurations in the Planar Newtonian Four-Body Problem. 192-204 - Alexander Gusev, Vladimir P. Gerdt, Michail S. Kaschiev, Vitaly Rostovtsev, Valentin Samoylov, Tatyana Tupikova, Sergey I. Vinitsky:
A Symbolic-Numerical Algorithm for Solving the Eigenvalue Problem for a Hydrogen Atom in Magnetic Field. 205-218 - Jaime Gutierrez, David Sevilla:
On Decomposition of Tame Polynomials and Rational Functions. 219-226 - Isroil A. Ikromov, Akhmadjon Soleev:
Newton Polyhedra and an Oscillation Index of Oscillatory Integrals with Convex Phases. 227-239 - Vladimir V. Kornyak:
Cellular Automata with Symmetric Local Rules. 240-250 - Natasha Malaschonok:
Parallel Laplace Method with Assured Accuracy for Solutions of Differential Equations by Symbolic Computations. 251-260 - Alexander Semenov:
On Connection Between Constructive Involutive Divisions and Monomial Orderings. 261-278 - Gerrit Sobottka, Andreas Weber:
A Symbolic-Numeric Approach to Tube Modeling in CAD Systems. 279-283 - Doru Stefanescu:
Inequalities on Upper Bounds for Real Polynomial Roots. 284-294 - Thomas Sturm:
New Domains for Applied Quantifier Elimination. 295-301 - Stephen M. Watt:
Algorithms for Symbolic Polynomials. 302 - Song Y. Yan, Glyn James:
Testing Mersenne Primes with Elliptic Curves. 303-312
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.