default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 42
Volume 42, October 2017
- Larisa Yaroslavtseva:
On non-polynomial lower error bounds for adaptive strong approximation of SDEs. 1-18 - Kirkwood Cloud, Mark Huber:
Fast perfect simulation of Vervaat perpetuities. 19-30 - Michael Maller:
On the complexity of Anosov saddle transitions. 31-43 - George Labahn, Vincent Neiger
, Wei Zhou:
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. 44-71 - Peter Bürgisser, Felipe Cucker, Elisa Rocha Cardozo:
On the condition of the zeros of characteristic polynomials. 72-84 - Markus Passenbrunner:
Orthogonal projectors onto spaces of periodic splines. 85-93 - Alexander D. Gilbert, Greg W. Wasilkowski:
Small superposition dimension and active set construction for multivariate integration under modest error demand. 94-109
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-31 21:47 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:
