The following pages link to Journal of Complexity (Q162057):
Displaying 50 items.
- Ultrastability of \(n\)th minimal errors (Q432764) (← links)
- On optimal two-level nonregular factorial split-plot designs (Q432766) (← links)
- Widths of Besov classes of generalized smoothness on the sphere (Q432768) (← links)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769) (← links)
- Obituary: Jean-Pierre Dedieu, 1949-2012 (Q454820) (← links)
- Adaptive parameter choice for one-sided finite difference schemes and its application in diabetes technology (Q454822) (← links)
- Average case tractability of non-homogeneous tensor product problems (Q454823) (← links)
- Majorizing sequences for iterative procedures in Banach spaces (Q454824) (← links)
- The Jackson inequality and widths of function classes in \(L^2([0,1],x^{2v+1})\) (Q454826) (← links)
- A condition-based algorithm for solving polyhedral feasibility problems (Q457560) (← links)
- Orthogonal polynomial expansions on sparse grids (Q457562) (← links)
- Uniform weak tractability of multivariate problems with increasing smoothness (Q457564) (← links)
- Tractability of linear problems defined over Hilbert spaces (Q457565) (← links)
- Complexity of parametric integration in various smoothness classes (Q457567) (← links)
- On lower complexity bounds for large-scale smooth convex optimization (Q478994) (← links)
- Complexity of oscillatory integration for univariate Sobolev spaces (Q478995) (← links)
- Tractability using periodized generalized Faure sequences (Q478997) (← links)
- The descriptive complexity of stochastic integration (Q478999) (← links)
- Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface (Q479000) (← links)
- On construction of blocked general minimum lower-order confounding \(2^{n - m} : 2^r\) designs with \(N / 4 + 1 \leq n \leq 5 N / 16\) (Q479001) (← links)
- On the complexity of computing quadrature formulas for marginal distributions of SDEs (Q479002) (← links)
- Approximation of additive random fields based on standard information: average case and probabilistic settings (Q491082) (← links)
- Average sampling and space-frequency localized frames on bounded domains (Q491083) (← links)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- New ultimate bound sets and exponential finite-time synchronization for the complex Lorenz system (Q491088) (← links)
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\) (Q491089) (← links)
- Two- and three-level lower bounds for mixture \(L_2\)-discrepancy and construction of uniform designs by threshold accepting (Q491092) (← links)
- NP-hardness of multiple bondage in graphs (Q491093) (← links)
- Construction of second-order orthogonal sliced Latin hypercube designs (Q491095) (← links)
- The exact information-based complexity of smooth convex minimization (Q511109) (← links)
- Adaptive approximation of the minimum of Brownian motion (Q511112) (← links)
- Lower bounds by Birkhoff interpolation (Q511113) (← links)
- Super-polynomial convergence and tractability of multivariate integration for infinitely times differentiable functions (Q511114) (← links)
- On the Petras algorithm for verified integration of piecewise analytic functions (Q511115) (← links)
- Preasymptotics and asymptotics of approximation numbers of anisotropic Sobolev embeddings (Q511116) (← links)
- On second order orthogonal Latin hypercube designs (Q511118) (← links)
- Special issue: Dagstuhl 2009. Selected papers based on the presentations at the seminar algorithms and complexity for continuous problems Dagstuhl, Germany, September 20--25, 2009. (Q536530) (← links)
- On positive positive-definite functions and Bochner's theorem (Q544116) (← links)
- Tractability of tensor product problems in the average case setting (Q544118) (← links)
- Construction algorithms for higher order polynomial lattice rules (Q544121) (← links)
- On the randomized solution of initial value problems (Q544122) (← links)
- Quasi-polynomial tractability (Q544123) (← links)
- Deterministic multi-level algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\) (Q544124) (← links)
- The randomized complexity of indefinite integration (Q544127) (← links)
- Complexity of numerical integration over spherical caps in a Sobolev space setting (Q544128) (← links)
- A lower bound on complexity of optimization under the \(r\)-fold integrated Wiener measure (Q544129) (← links)
- Liberating the dimension for function approximation: standard information (Q555029) (← links)
- Geometric isomorphism check for symmetric factorial designs (Q555030) (← links)
- Existence and construction of shifted lattice rules with an arbitrary number of points and bounded weighted star discrepancy for general decreasing weights (Q555032) (← links)
- B-spline quasi-interpolation on sparse grids (Q555033) (← links)
