The following pages link to Journal of Complexity (Q162057):
Displaying 50 items.
- A low complexity probabilistic test for integer multiplication (Q983183) (← links)
- Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory (Q983184) (← links)
- Computational complexity of tissue-like P systems (Q983185) (← links)
- Improved generalized differentiability conditions for Newton-like methods (Q983186) (← links)
- The approximation characteristic of diagonal matrix in probabilistic setting (Q990816) (← links)
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem (Q990817) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- Approximation of high-dimensional kernel matrices by multilevel circulant matrices (Q990819) (← links)
- The use of higher order finite difference schemes is not dangerous (Q998974) (← links)
- Explicit error bounds for lazy reversible Markov chain Monte Carlo (Q998975) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- General local convergence theory for a class of iterative processes and its applications to Newton's method (Q998977) (← links)
- Complexity of Gaussian-radial-basis networks approximating smooth functions (Q998978) (← links)
- An algorithmic approach to finding factorial designs with generalized minimum aberration (Q998979) (← links)
- An alternating-direction sinc-Galerkin method for elliptic problems (Q1023273) (← links)
- Numerical study of pressure distribution in entrance pipe flow (Q1023276) (← links)
- New averaging technique for approximating weighted integrals (Q1023278) (← links)
- Polynomial function and derivative approximation of Sinc data (Q1023279) (← links)
- Weighted approximation by entire functions interpolating at finitely or infinitely many points on the real line (Q1023280) (← links)
- Optimal learning of bandlimited functions from localized sampling (Q1023396) (← links)
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems (Q1023397) (← links)
- Smale's point estimate theory for Newton's method on Lie groups (Q1023398) (← links)
- Energies, group-invariant kernels and numerical integration on compact manifolds (Q1023399) (← links)
- High resolution quantization and entropy coding of jump processes (Q1023401) (← links)
- Learning from uniformly ergodic Markov chains (Q1023402) (← links)
- Elastic-net regularization in learning theory (Q1023403) (← links)
- Iterative root approximation in \(p\)-adic numerical analysis (Q1049397) (← links)
- On the weakening of the convergence of Newton's method using recurrent functions (Q1049398) (← links)
- On the approximation of smooth functions using generalized digital nets (Q1049399) (← links)
- Tractability of the Helmholtz equation with non-homogeneous Neumann boundary conditions: the relation to the \(L_{2}\)-approximation (Q1049400) (← links)
- Quasi-gcd computations (Q1071503) (← links)
- Optimal algorithms for image understanding: Current status and future plans (Q1071510) (← links)
- Average case optimality (Q1071513) (← links)
- Structuring causal trees (Q1074340) (← links)
- On the existence of generally convergent algorithms (Q1077876) (← links)
- Monte-Carlo algorithms for the planar multiterminal network reliability problem (Q1079111) (← links)
- Optimal precision in the presence of uncertainty (Q1079953) (← links)
- On the optimal solution of large eigenpair problems (Q1080619) (← links)
- On the Kolmogorov complexity of functions of finite smoothness (Q1080660) (← links)
- A survey of information-based complexity (Q1080661) (← links)
- Approximation of linear functionals on a Banach space with a Gaussian measure (Q1082039) (← links)
- Approximation in a continuous model of computing (Q1082816) (← links)
- A 71/60 theorem for bin packing (Q1083194) (← links)
- Discrete allocation mechanisms: Dimensional requirements for resource- allocation mechanisms when desired outcomes are unbounded (Q1083342) (← links)
- Parallel and sequential computation: A statistician's view (Q1084862) (← links)
- Complexity of differential and integral equations (Q1085950) (← links)
- Continuous optimization problems and a polynomial hierarchy of real functions (Q1086557) (← links)
- For which error criteria can we solve nonlinear equations? (Q1086984) (← links)
- Optimal solution of nonlinear equations (Q1086985) (← links)
- Probabilistic setting of information-based complexity (Q1092660) (← links)
