default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 24
Volume 24, Number 1, February 2008
- Peter Bürgisser, Andrei Gabrielov, Teresa Krick, Gregorio Malajovich
:
Guest Editor's Preface. 2 - Klaus Meer, Martin Ziegler:
An explicit solution to Post's Problem over the reals. 3-15 - Guillaume Malod, Natacha Portier:
Characterizing Valiant's algebraic complexity classes. 16-38 - Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé:
Finding a vector orthogonal to roughly half a collection of vectors. 39-53 - Y. Yomdin:
Analytic reparametrization of semi-algebraic sets. 54-76
Volume 24, Number 2, April 2008
- Stefan Heinrich, Bernhard Milla:
The randomized complexity of initial value problems. 77-88 - Jean-Pierre Dedieu, Gregorio Malajovich:
On the number of minima of a random polynomial. 89-108 - Junyi Lin, Xiaoqun Wang:
New Brownian bridge construction in quasi-Monte Carlo methods for computational finance. 109-133 - Aicke Hinrichs, Friedrich Pillichshammer, Wolfgang Ch. Schmid:
Tractability properties of the weighted star discrepancy. 134-143 - Li-Ping Wang, Harald Niederreiter:
Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences. 144-153 - Michael Gnewuch:
Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy. 154-172 - Jia Jie Liu, Yue-Li Wang, Richard C. T. Lee:
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string. 173-184 - José Manuel Gutiérrez Jiménez, Miguel Ángel Hernández-Verón, Natalia Romero Álvarez:
A note on a modification of Moser's method. 185-197 - Yanjie Jiang:
Approximation of anisotropic classes by standard information. 198-213 - Jun Ji, Florian A. Potra:
On the probabilistic complexity of finding an approximate solution for linear programming. 214-227 - Santhosh George, M. Thamban Nair:
A modified Newton-Lavrentiev regularization for nonlinear ill-posed Hammerstein-type operator equations. 228-240 - Baohuai Sheng, Jianli Wang, Ping Li:
The covering number for some Mercer kernel Hilbert spaces. 241-258 - Yongping Liu, Lianhong Yang:
Relative widths of smooth functions determined by fractional order derivatives. 259-282 - Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski:
Lattice rule algorithms for multivariate approximation in the average case setting. 283-323
Volume 24, Number 3, June 2008
- Bart Vandewoestyne, Ronald Cools:
On obtaining higher order convergence for smooth periodic functions. 328-340 - Silvana Ilie, Gustaf Söderlind, Robert M. Corless:
Adaptivity and computational complexity in the numerical solution of ODEs. 341-361 - M. A. Lifshits, Marguerite Zani:
Approximation complexity of additive random fields. 362-379 - Shahar Mendelson:
Obtaining fast error rates in nonconvex situations. 380-397 - Gensun Fang, Liqin Duan:
The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods. 398-409 - Michael Vielhaber, Mónica del Pilar Canales Chacon:
The asymptotic normalized linear complexity of multisequences. 410-422 - Chong Li, Jinhua Wang:
Newton's method for sections on Riemannian manifolds: Generalized covariant alpha-theory. 423-451
Volume 24, Number 4, August 2008
- Boleslaw Z. Kacewicz, Pawel Przybylowicz:
Optimal adaptive solution of initial-value problems with unknown singularities. 455-476 - Volker Bosserhoff:
Are unbounded linear operators computable on the average for Gaussian measures? 477-491 - Cruz E. Borges, Luis M. Pardo:
On the probability distribution of data at points in real complete intersection varieties. 492-523 - Hoi-Nam Mok, Wing-Keung To:
Effective Pólya semi-positivity for non-negative polynomials on the simplex. 524-544 - Jan Vybíral:
Widths of embeddings in function spaces. 545-570
Volume 24, Numbers 5-6, October - December 2008
- Josef Dick, Harald Niederreiter:
On the exact t-value of Niederreiter and Sobol' sequences. 572-581 - Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor:
A numerical algorithm for zero counting, I: Complexity and accuracy. 582-605 - Zhi-Wei Pan, Dao-Hong Xiang, Quan-Wu Xiao, Ding-Xuan Zhou:
Parzen windows for multi-class classification. 606-618 - Hongzhi Tong, Di-Rong Chen, Lizhong Peng:
Learning rates for regularized classifiers using multivariate polynomial kernels. 619-631 - José Claudinei Ferreira, Valdir Antonio Menegatto, A. P. Peron:
Integral operators on the sphere generated by positive definite smooth kernels. 632-647 - Nina Brandstätter, Wilfried Meidl:
On the linear complexity of Sidel'nikov sequences over nonprime fields. 648-659
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-10-30 00:55 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:
