The following pages link to Journal of Complexity (Q162057):
Displaying 50 items.
- On expansion of algebraic functions in power and Puiseux series. I (Q1094132) (← links)
- Polynomial division and its computational complexity (Q1094135) (← links)
- The concept of sequential optimality for problems in numerical analysis (Q1098565) (← links)
- Do numerical orbits of chaotic dynamical processes represent true orbits? (Q1099932) (← links)
- On the topology of algorithms. I (Q1099953) (← links)
- On the existence of optimal affine methods for approximating linear functionals (Q1100370) (← links)
- An optimal recovery view of Walsh's equiconvergence theorem (Q1100581) (← links)
- Complexity of approximation with relative error criterion in worst, average, and probabilistic settings (Q1100662) (← links)
- The geometry of ill-conditioning (Q1100848) (← links)
- Some informational requirements for convergence (Q1100851) (← links)
- An information-based approach to ill-posed problems (Q1100852) (← links)
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps (Q1100853) (← links)
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity (Q1100895) (← links)
- Communication complexity of convex optimization (Q1100896) (← links)
- Bin packing with divisible item sizes (Q1100914) (← links)
- On the worst-case arithmetic complexity of approximating zeros of polynomials (Q1101184) (← links)
- Complexity of fixed points. I (Q1101185) (← links)
- Optimal solution of ordinary differential equations (Q1102074) (← links)
- A new simple homotopy algorithm for linear programming. I (Q1102185) (← links)
- A note on the trade-off between sampling and quantization in signal processing (Q1102254) (← links)
- Information-based numerical practice (Q1102700) (← links)
- Approximating a function by choosing a covering of its domain and k points from its range (Q1103320) (← links)
- A fast algorithm for the discrete Laplace transformation (Q1104064) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- A regularized solution to edge detection (Q1104116) (← links)
- Deadlock avoidance for systolic communication (Q1104743) (← links)
- Probabilistic satisfiability (Q1104751) (← links)
- On the capabilities of multilayer perceptrons (Q1105387) (← links)
- On the complexity of loading shallow neural networks (Q1105389) (← links)
- Lower bound for connectivity in local-learning neural networks (Q1106023) (← links)
- Dynamics and architecture for neural computation (Q1106025) (← links)
- Asymptotic error of algorithms for solving nonlinear problems (Q1106626) (← links)
- Algorithmic and complexity issues of robot motion in an uncertain environment (Q1109740) (← links)
- On expansion of algebraic functions in power and Puiseux series. II (Q1109930) (← links)
- Conditionally optimal algorithms and estimation of reduced order models (Q1112002) (← links)
- On adaption with noisy information (Q1113867) (← links)
- Random problems (Q1113868) (← links)
- Minimum asymptotic error of algorithms for solving ODE (Q1114351) (← links)
- A stochastic analog to Chebyshev centers and optimal average case algorithms (Q1117550) (← links)
- VLSI-sorting evaluated under the linear model (Q1117701) (← links)
- On a class of omnibus algorithms for zero-finding (Q1118978) (← links)
- Can we approximate zeros of functions with nonzero topological degree? (Q1119338) (← links)
- On the power of two-point based sampling (Q1120201) (← links)
- A Monte Carlo method for the parallel solution of linear systems (Q1120249) (← links)
- Optimal complexity recovery of band- and energy-limited signals. II (Q1120540) (← links)
- A clock synchronization problem with random delays (Q1121019) (← links)
- Optimal search algorithm for extrema of a discrete periodic bimodal function (Q1121183) (← links)
- Randomization for continuous problems (Q1122297) (← links)
- Statistical complexity of the power method for Markov chains (Q1122306) (← links)
- On zero finding methods of higher order from data at one point (Q1122311) (← links)
