The following pages link to Journal of Complexity (Q162057):
Displaying 50 items.
- Interpolation lattices for hyperbolic cross trigonometric polynomials (Q657653) (← links)
- Complexity bounds for second-order optimality in unconstrained optimization (Q657654) (← links)
- Bit-size estimates for triangular sets in positive dimension (Q657656) (← links)
- Special issue: Algorithms and complexity for continuous problems. Seminar, Dagstuhl, Germany, September 24--29, 2000 (Q700168) (← links)
- Linear vs standard information for scalar stochastic differential equations (Q700169) (← links)
- On the \(L_2\)-discrepancy of the Sobol-Hammersley net in dimension 3 (Q700170) (← links)
- On the representation of band limited functions using finitely many bits (Q700171) (← links)
- Tractability of integration in non-periodic and periodic weighted tensor product Hilbert spaces (Q700172) (← links)
- Direct estimation of linear functionals from indirect noisy observations (Q700173) (← links)
- Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\) (Q700174) (← links)
- Piecewise linear approximation of smooth compact fibers (Q700176) (← links)
- Extra-updates criterion for the limited memory BFGS algorithm for large scale nonlinear optimization (Q700177) (← links)
- On the complexity of exclusion algorithms for optimization (Q700180) (← links)
- Verifying topological indices for higher-order rank deficiencies (Q700182) (← links)
- On the complexity of isolating real roots and computing with certainty the topological degree (Q700184) (← links)
- A two-dimensional bisection envelope algorithm for fixed points (Q700187) (← links)
- What is the complexity of volume calculation? (Q700188) (← links)
- Linear vs. nonlinear algorithms for linear problems (Q706787) (← links)
- Randomized and quantum algorithms yield a speed-up for initial-value problems (Q706788) (← links)
- Real recursive functions and their hierarchy (Q706790) (← links)
- Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure (Q706793) (← links)
- Sharp asymptotics of the metric entropy for ellipsoids (Q706794) (← links)
- Tractability through increasing smoothness (Q708309) (← links)
- Liberating the dimension (Q708310) (← links)
- Dimension-wise integration of high-dimensional functions with applications to finance (Q708311) (← links)
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (Q708312) (← links)
- Spatially adaptive sparse grids for high-dimensional data-driven problems (Q708314) (← links)
- The smoothing effect of the ANOVA decomposition (Q708315) (← links)
- An overlapping additive Schwarz preconditioner for interpolation on the unit sphere with spherical radial basis functions (Q708316) (← links)
- Points on manifolds with asymptotically optimal covering radius (Q722761) (← links)
- Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods (Q722763) (← links)
- Modular composition via factorization (Q722764) (← links)
- Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness (Q722765) (← links)
- The rank of random regular digraphs of constant degree (Q722766) (← links)
- Recovery of derivatives for functions defined on the semiaxis (Q722767) (← links)
- An upper bound on the smallest singular value of a square random matrix (Q722769) (← links)
- Duality for digital sequences (Q731970) (← links)
- On the tractability of linear tensor product problems in the worst case (Q731971) (← links)
- A fast Petrov-Galerkin method for solving the generalized airfoil equation (Q731972) (← links)
- Oracle inequalities for support vector machines that are based on random entropy numbers (Q731974) (← links)
- Randomized approximation of Sobolev embeddings. II (Q731975) (← links)
- Randomized approximation of Sobolev embeddings. III (Q731976) (← links)
- On adaptive and non-adaptive stochastic and deterministic algorithms (Q749453) (← links)
- Complexity of multilinear problems in the worst case setting (Q749507) (← links)
- Selecting relevant projections onto subsets of coordinates: A minimax dependence-based approach (Q750027) (← links)
- On the asymptotic behavior of the projective rescaling algorithm for linear programming (Q750290) (← links)
- Computing topological degree using noisy information (Q750943) (← links)
- s-numbers in information-based complexity (Q757049) (← links)
- Probabilistic complexity analysis for linear problems in bounded domains (Q757053) (← links)
- On the average complexity of multivariate problems (Q757054) (← links)
