default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th CASC 2016: Bucharest, Romania
- Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsov:
Computer Algebra in Scientific Computing - 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings. Lecture Notes in Computer Science 9890, Springer 2016, ISBN 978-3-319-45640-9 - Sergei A. Abramov
:
On the Differential and Full Algebraic Complexities of Operator Matrices Transformations. 1-14 - Mario Albert, Werner M. Seiler:
Resolving Decompositions for Polynomial Modules. 15-29 - Winfried Auzinger, Wolfgang Herfort, Harald Hofstätter, Othmar Koch:
Setup of Order Conditions for Splitting Methods. 30-42 - Winfried Auzinger, Harald Hofstätter, Othmar Koch:
Symbolic Manipulation of Flows of Nonlinear Evolution Equations, with Application in the Analysis of Split-Step Time Integrators. 43-57 - Bentolhoda Binaei, Amir Hashemi, Werner M. Seiler:
Improved Computation of Involutive Bases. 58-72 - Nathan Bliss, Jan Verschelde:
Computing All Space Curve Solutions of Polynomial Systems by Polyhedral Methods. 73-86 - D. V. Bogdanov, Alexey A. Kytmanov, Timur M. Sadykov:
Algorithmic Computation of Polynomial Amoebas. 87-100 - Charles Bouillaguet, Claire Delaplace:
Sparse Gaussian Elimination Modulo p: An Update. 101-116 - Curtis Bright, Vijay Ganesh, Albert Heinle, Ilias S. Kotsireas, Saeed Nejati, Krzysztof Czarnecki:
MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures. 117-133 - Cristian S. Calude, Declan Thompson:
Incompleteness, Undecidability and Automated Proofs - (Invited Talk). 134-155 - Changbo Chen, Wenyuan Wu:
A Numerical Method for Computing Border Curves of Bi-parametric Real Polynomial Systems and Applications. 156-171 - Matthew England, James H. Davenport:
The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree. 172-192 - Madalina Erascu:
Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms. 193-211 - Alexander Gusev, Vladimir P. Gerdt, Luong Le Hai, V. L. Derbov, Sergey I. Vinitsky, Ochbadrakh Chuluunbaatar:
Symbolic-Numeric Algorithms for Solving BVPs for a System of ODEs of the Second Order: Multichannel Scattering and Eigenvalue Problems. 212-227 - A. A. Gusev, Vladimir P. Gerdt, Sergey I. Vinitsky, V. L. Derbov, Andrzej Gózdz, Aleksandra Pedrak, A. Szulerecka, A. Dobrowolski:
Symbolic Algorithm for Generating Irreducible Rotational-Vibrational Bases of Point Groups. 228-242 - Sergey A. Gutnik, Vasily A. Sarychev:
A Symbolic Investigation of the Influence of Aerodynamic Forces on Satellite Equilibria. 243-254 - Thomas Hahn:
Computer Algebra in High-Energy Physics (Invited Talk). 255-275 - Amir Hashemi, Delaram Talaashrafi:
A Note on Dynamic Gröbner Bases Computation. 276-288 - Valentin Irtegov, Tatiana Titorenko:
Qualitative Analysis of the Reyman - Semenov-Tian-Shansky Integrable Case of the Generalized Kowalewski Top. 289-304 - Elizabeth A. Kalinina:
On Multiple Eigenvalues of a Matrix Dependent on a Parameter. 305-314 - Gereon Kremer, Florian Corzilius, Erika Ábrahám:
A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic. 315-335 - Marshall Law, Michael B. Monagan:
Computing Characteristic Polynomials of Matrices of Structured Polynomials. 336-348 - François Lemaire, Alexandre Temperville:
Computing Sparse Representations of Systems of Rational Fractions. 349-366 - Dominik L. Michels, Dmitry A. Lyakhov, Vladimir P. Gerdt, Zahid Hossain, Ingmar H. Riedel-Kruse, Andreas G. Weber:
On the General Analytical Solution of the Kinematic Cosserat Equations. 367-380 - Michael B. Monagan, Baris Tuncer:
Using Sparse Interpolation in Hensel Lifting. 381-400 - David Monniaux:
A Survey of Satisfiability Modulo Theory. 401-425 - Kacper Pluta, Guillaume Moroz, Yukiko Kenmochi, Pascal Romon:
Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image. 426-443 - Swaroop N. Prabhakar, Vikram Sharma:
A Lower Bound for Computing Lagrange's Real Root Bound. 444-456 - Tateaki Sasaki, Daiju Inaba:
Enhancing the Extended Hensel Construction by Using Gröbner Bases. 457-472 - Vasily P. Shapeev, Evgenii V. Vorozhtsov:
Symbolic-Numerical Optimization and Realization of the Method of Collocations and Least Residuals for Solving the Navier-Stokes Equations. 473-488 - Jeff Sommars, Jan Verschelde:
Pruning Algorithms for Pretropisms of Newton Polytopes. 489-503 - Doru Stefanescu:
Computational Aspects of a Bound of Lagrange. 504-511
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 2025-05-22 00:23 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:
