default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISSAC 2014: Kobe, Japan
- Katsusuke Nabeshima, Kosaku Nagasaka, Franz Winkler, Ágnes Szántó:
International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014. ACM 2014, ISBN 978-1-4503-2501-1
Invited talks
- Noriko H. Arai, Takuya Matsuzaki, Hidenao Iwane, Hirokazu Anai:
Mathematics by machine. 1-8 - David R. Stoutemyer:
Fuzzy simplification of non-numeric expressions containing some intervals and/or floating point numbers. 9-16 - Bernd Sturmfels:
Maximum likelihood for matrices with rank constraints. 17
Tutorials
- Hirokazu Anai:
Effective quantifier elimination for industrial applications. 18-19 - Mitsushi Fujimoto:
How to develop a mobile computer algebra system. 20 - Hiroyuki Goto
:
Introduction to max-plus algebra. 21-22 - François Le Gall:
Algebraic complexity theory and matrix multiplication. 23 - Hidefumi Ohsugi:
Gröbner bases of toric ideals and their application. 24 - Lihong Zhi:
Symbolic-numeric algorithms for computing validated results. 25-26
Contributed papers
- Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Sparse interpolation over finite fields via low-order roots of unity. 27-34 - Andrew Arnold, Daniel S. Roche:
Multivariate sparse interpolation using randomized Kronecker substitutions. 35-42 - Carlos E. Arreche:
Computing the differential Galois group of a parameterized second-order linear differential equation. 43-50 - Markus Bläser, Gorav Jindal:
A new deterministic algorithm for sparse multivariate polynomial interpolation. 51-58 - Alin Bostan, Xavier Caruso, Éric Schost:
A fast algorithm for computing the characteristic polynomial of the p-curvature. 59-66 - Alin Bostan, Thierry Combot, Mohab Safey El Din:
Computing necessary integrability conditions for planar parametrized homogeneous potentials. 67-74 - Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier:
Improved algorithm for computing separating linear forms for bivariate systems. 75-82 - Reinhold Burger:
Solving higher order linear differential equations having elliptic function coefficients. 83-90 - Changbo Chen, Marc Moreno Maza:
Quantifier elimination by cylindrical algebraic decomposition based on regular chains. 91-98 - Shaoshi Chen, Ruyong Feng, Ziming Li, Michael F. Singer:
Parallel telescoping and parameterized Picard-Vessiot theory. 99-106 - Shaoshi Chen, Manuel Kauers, Christoph Koutschan:
A generalized Apagodu-Zeilberger algorithm. 107-114 - Robert M. Corless, David J. Jeffrey, Fei Wang:
The asymptotic analysis of some interpolated nonlinear recurrence relations. 115-121 - Luca De Feo, Javad Doliskani, Éric Schost:
Fast arithmetic for the algebraic closure of finite fields. 122-129 - Daouda Niang Diatta, Fabrice Rouillier, Marie-Françoise Roy:
On the computation of the topology of plane curves. 130-137 - Volker Diekert, Jonathan Kausch:
Logspace computations in graph products. 138-145 - Jean-Guillaume Dumas, Erich L. Kaltofen:
Essentially optimal interactive certificates in linear algebra. 146-153 - Ioannis Z. Emiris, Raimundas Vidunas:
Root counts of semi-mixed systems, and an application to counting nash equilibria. 154-161 - Madalina Erascu, Hoon Hong:
Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation). 162-169 - Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault:
Sub-cubic change of ordering for Gröbner basis: a probabilistic approach. 170-177 - Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz:
Sparse Gröbner bases: the unmixed case. 178-185 - Oscar García Morchon, Domingo Gómez-Pérez, Jaime Gutierrez, Ronald Rietman, Ludo Tolhuizen:
The MMO problem. 186-193 - Mark Giesbrecht, Albert Heinle, Viktor Levandovskyy:
Factoring linear differential operators in n variables. 194-201 - Pascal Giorgi, Romain Lebreton:
Online order basis algorithm and its impact on the block Wiedemann algorithm. 202-209 - José Gómez-Torrecillas, Francisco Javier Lobillo, Gabriel Navarro:
On isomorphisms of modules over non-commutative PID. 210-216 - Georg Grasegger:
Radical solutions of first order autonomous algebraic ordinary differential equations. 217-223 - Bruno Grenet:
Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach. 224-231 - Elizabeth Gross, Jose Israel Rodriguez:
Maximum likelihood geometry in the presence of data zeros. 232-239 - Jingjun Han, Liyun Dai, Bican Xia:
Constructing fewer open cells by GCD computation in CAD projection. 240-247 - Jonathan D. Hauenstein, Ian Haywood, Alan C. Liddell Jr.:
An a posteriori certification algorithm for Newton homotopies. 248-255 - Fredrik Johansson:
Evaluating parametric holonomic sequences using rectangular splitting. 256-263 - Thomas Kahle, Robert Krone, Anton Leykin:
Equivariant lattice generators and Markov bases. 264-271 - Erich L. Kaltofen, Clément Pernet:
Sparse polynomial interpolation codes and their decoding beyond half the minimum distance. 272-279 - Erich L. Kaltofen, Zhengfeng Yang:
Sparse multivariate function recovery with a high error rate in the evaluations. 280-287 - Manuel Kauers:
Bounds for D-finite closure properties. 288-295 - François Le Gall:
Powers of tensors and fast matrix multiplication. 296-303 - Hongbo Li, Changpeng Shao, Lei Huang, Yue Liu:
Reduction among bracket polynomials. 304-311 - Suzy S. Maddah, Moulay A. Barkatou, Hassan Abbas:
Formal solutions of a class of Pfaffian systems in two variables. 312-319 - Suzy S. Maddah, Moulay A. Barkatou, Hassan Abbas:
On the reduction of singularly-perturbed linear differential systems. 320-327 - Lingchuan Meng, Jeremy Johnson:
High performance implementation of the TFT. 328-334 - Manfred Minimair:
Randomized detection of extraneous factors. 335-342 - Bernard Mourrain, Philippe Trébuchet:
Toric border basis. 343-350 - Katsusuke Nabeshima, Shinichi Tajima:
On efficient algorithms for computing parametric local cohomology classes associated with semi-quasihomogeneous singularities and standard bases. 351-358 - Michael Sagraloff:
A near-optimal algorithm for computing real roots of sparse polynomials. 359-366 - Saruchi, Ivan Morel, Damien Stehlé, Gilles Villard:
LLL reducing with the most significant bits. 367-374 - J. Rafael Sendra, David Sevilla, Carlos Villarino:
Covering of surfaces parametrized without projective base points. 375-380 - Arne Storjohann, Shiyun Yang:
Linear independence oracles and applications to rectangular and low rank linear systems. 381-388 - Adam W. Strzebonski:
Cylindrical algebraic decomposition using local projections. 389-396 - Tristan Vaccon:
Matrix-F5 algorithms over finite-precision complete discrete valuation fields. 397-404 - Joris van der Hoeven:
Faster relaxed multiplication. 405-412 - Wei Zhou, George Labahn:
Unimodular completion of polynomial matrices. 413-420 - Konstantin Ziegler:
Tame decompositions and collisions. 421-428
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-11-18 20:32 CET 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:
