The following pages link to Journal of Complexity (Q162057):
Displaying 50 items.
- Simple algorithms for approximating all roots of a polynomial with real roots (Q757494) (← links)
- Minimax quadratic estimation of a quadratic functional (Q758038) (← links)
- Probabilistic analysis of numerical integration algorithms (Q758101) (← links)
- Critical points and values of complex polynomials (Q804635) (← links)
- Noisy information for linear problems in the asymptotic setting (Q806961) (← links)
- On the mean square weighted \(\mathcal {L}_2\) discrepancy of randomized digital nets in prime base (Q855890) (← links)
- Randomly shifted lattice rules for unbounded integrands (Q855892) (← links)
- Exact cubature for a class of functions of maximum effective dimension (Q855894) (← links)
- A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer (Q855896) (← links)
- Almost optimal solution of initial-value problems by randomized and quantum algorithms (Q855897) (← links)
- The quantum query complexity of elliptic PDE (Q855898) (← links)
- Ideals in constructive Banach algebra theory (Q864422) (← links)
- Randomness and universal machines (Q864423) (← links)
- A sequentially computable function that is not effectively continuous at any point (Q864424) (← links)
- Representing probability measures using probabilistic processes (Q864426) (← links)
- Generalized functions with pseudobounded support in constructive mathematics (Q864428) (← links)
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain (Q864430) (← links)
- A hierarchy of Turing degrees of divergence bounded computable real numbers (Q864432) (← links)
- Effectively open real functions (Q864433) (← links)
- Random non-cupping revisited (Q864434) (← links)
- Towards computability of elliptic boundary value problems in variational formulation (Q864435) (← links)
- Pre-apartness structures on spaces of functions (Q864436) (← links)
- Effective continuities on effective topological spaces (Q864437) (← links)
- The basic feasible functionals in computable analysis (Q864439) (← links)
- Computing Schrödinger propagators on type-2 Turing machines (Q864440) (← links)
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- A component-by-component approach to efficient numerical integration over products of spheres (Q870337) (← links)
- On regularization algorithms in learning theory (Q870339) (← links)
- Approximation of infinitely differentiable multivariate functions is not strongly tractable (Q870341) (← links)
- Counting solutions to binomial complete intersections (Q870342) (← links)
- Multi-kernel regularized classifiers (Q870343) (← links)
- On the complexity of Putinar's Positivstellensatz (Q870344) (← links)
- Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy (Q876814) (← links)
- On the complexity of curve fitting algorithms (Q876816) (← links)
- On the convergence rate of the component-by-component construction of good lattice rules (Q876817) (← links)
- On invariance of degree for certain computations (Q876819) (← links)
- On the complexity of Schmüdgen's Positivstellensatz (Q876820) (← links)
- On the tractability of multivariate integration and approximation by neural networks (Q876822) (← links)
- Complexity and effective dimension of discrete Lévy areas (Q883328) (← links)
- Error linear complexity measures for multisequences (Q883329) (← links)
- Factoring bivariate sparse (lacunary) polynomials (Q883330) (← links)
- On the complexity of \(p\)-adic basic semi-algebraic sets (Q883331) (← links)
- Regularization by truncated Cholesky factorization: a comparison of four different approaches (Q883332) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
- Generalized tractability for multivariate problems. I: Linear tensor product problems and linear information (Q883336) (← links)
- A Koksma-Hlawka inequality for general discrepancy systems (Q890224) (← links)
- On integration methods based on scrambled nets of arbitrary size (Q890226) (← links)
- Quasi-Monte Carlo tractability of high dimensional integration over products of simplices (Q890227) (← links)
- Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements (Q890228) (← links)
- Nonlinear tensor product approximation of functions (Q890230) (← links)
