default search action
ISSAC 2012: Grenoble, France
- Joris van der Hoeven, Mark van Hoeij:
International Symposium on Symbolic and Algebraic Computation, ISSAC'12, Grenoble, France - July 22 - 25, 2012. ACM 2012, ISBN 978-1-4503-1269-1 - Frits Beukers:
A-hypergeometric functions: computational aspects. 1-2 - Marie-Françoise Roy:
Complexity of deciding connectivity in real algebraic sets: recent results and future research directions. 3-5 - Volker Strassen:
Asymptotic spectrum and matrix multiplication. 6-7 - Pascal Koiran:
Upper bounds on real roots and lower bounds for the permanent. 8 - Viktor Levandovskyy:
Elements of computer-algebraic analysis. 9-10 - Seth Sullivant:
Algebraic statistics. 11 - Sergei A. Abramov
, Denis E. Khmelnov
On valuations of meromorphic solutions of arbitrary-order linear difference systems with polynomial coefficients. 12-19 - Danko Adrovic, Jan Verschelde:
Computing Puiseux series for algebraic surfaces. 20-27 - Martin R. Albrecht:
The M4RIE library for dense linear algebra over small fields with even characteristic. 28-34 - Maria Emilia Alonso Garcia
A root isolation algorithm for sparse univariate polynomials. 35-42 - Moulay A. Barkatou, Thomas Cluzeau, Carole El Bacha, Jacques-Arthur Weil:
Computing closed form solutions of integrable connections. 43-50 - Moulay A. Barkatou, Clemens G. Raab
Solving linear ordinary differential systems in hyperexponential extensions. 51-58 - Jérémy Berthomieu
Relaxed p-adic Hensel lifting for algebraic systems. 59-66 - Luk Bettale
Solving polynomial systems over finite fields: improved analysis of the hybrid approach. 67-74 - Jean-François Biasse
A polynomial time algorithm for computing the HNF of a module over the integers of a number field. 75-82 - Francesco Biscani:
Parallel sparse polynomial multiplication on modern hardware architectures. 83-90 - Raoul Blankertz, Joachim von zur Gathen, Konstantin Ziegler:
Compositions and collisions at degree p2. 91-98 - Alin Bostan, Frédéric Chyzak, Bruno Salvy
Fast computation of common left multiples of linear ordinary differential operators. 99-106 - Alin Bostan, Bruno Salvy
Power series solutions of singular (q)-differential equations. 107-114 - Olivier Bournez, Daniel Silva Graça
On the complexity of solving initial value problems. 115-121 - Shaoshi Chen, Manuel Kauers:
Order-degree curves for hypergeometric creative telescoping. 122-129 - Shaoshi Chen, Manuel Kauers, Michael F. Singer:
Telescopers for rational and algebraic functions via residues. 130-137 - Matthew T. Comer, Erich L. Kaltofen
Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values. 138-145 - Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin
Fast computation of Smith forms of sparse matrices over local rings. 146-153 - Pavel Emeliyanenko, Michael Sagraloff:
On the complexity of solving a bivariate polynomial system. 154-161 - Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
Critical points and Gröbner bases: the unmixed case. 162-169 - Jean-Charles Faugère, Jules Svartz:
Solving polynomial systems globally invariant under an action of the symmetric group and application to the equilibria of N vortices in the plane. 170-178 - Stavros Garoufalidis
Twisting q-holonomic sequences by complex roots of unity. 179-186 - Ambros M. Gleixner
Improving the accuracy of linear programming solvers with iterative refinement. 187-194 - Feng Guo, Erich L. Kaltofen
Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. 195-202 - Bjarke Hammersholt Roune, Michael Eugene Stillman:
Practical Gröbner basis computation. 203-210 - Joris van der Hoeven, Grégoire Lecerf:
On the complexity of multivariate blockwise polynomial multiplication. 211-218 - Evelyne Hubert, George Labahn:
Rational invariants of scalings from Hermite normal forms. 219-226 - Masao Ishikawa, Christoph Koutschan
Zeilberger's holonomic ansatz for Pfaffians. 227-233 - Romain Lebreton
Algorithms for the universal decomposition algebra. 234-241 - Paolo Lella
An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme. 242-248 - Yue Ma, Lihong Zhi:
Computing real solutions of polynomial systems via low-rank moment matrix completion. 249-256 - James McCarron
Small homogeneous quandles. 257-264 - Bernard Mourrain, Philippe Trebuchet:
Border basis representation of a general quotient algebra. 265-272 - Toshinori Oaku:
An algorithm to compute the differential equations for the logarithm of a polynomial. 273-280 - Colton Pauderis, Arne Storjohann:
Deterministic unimodularity certification. 281-288 - Ana Romero
Programming before theorizing, a case study. 289-296 - Michael Sagraloff:
When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial. 297-304 - Peter Scheiblechner:
Effective de Rham cohomology: the hypersurface case. 305-310 - Ákos Seress:
Construction of 2-closed M-representations. 311-318 - Vikram Sharma, Chee-Keng Yap:
Near optimal tree size bounds on a simple real root isolation algorithm. 319-326 - Vlad Slavici, Daniel Kunkle, Gene Cooperman, Stephen A. Linton:
An efficient programming model for memory-intensive recursive algorithms using parallel disks. 327-334 - Adam W. Strzebonski
Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas. 335-342 - Adam W. Strzebonski
Univariate real root isolation in multiple extension fields. 343-350 - Yao Sun, Dingkang Wang, Xiaodong Ma, Yang Zhang:
A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras. 351-358 - Mingbo Zhang, Yong Luo:
Factorization of differential operators with ordinary differential polynomial coefficients. 359-365 - Wei Zhou, George Labahn, Arne Storjohann:
Computing minimal nullspace bases. 366-373
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-12-19 22:17 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: