J. Complexity - researchr journal

researchr

You are not signed in
Sign in
Sign up

271	--	294	D. V. Chudnovsky, G. V. Chudnovsky. On expansion of algebraic functions in power and Puiseux series, I
295	--	305	David Lee. Fast multiplication of a recursive block Toeplitz matrix by a vector and its application
306	--	316	Boleslaw Z. Kacewicz, Grzegorz W. Wasilkowski. How powerful is continuous nonlinear information for linear problems?
323	--	332	Boris S. Veroy. An optimal algorithm for search of extrema of a bimodal function
333	--	352	I. P. Huerta. Adaption helps for some nonconvex classes

179	--	203	Dario Bini, Victor Y. Pan. Polynomial division and its computational complexity
204	--	228	Grzegorz W. Wasilkowski. Information of varying cardinality
229	--	238	Erich Novak. On average case errors in numerical analysis
239	--	254	Marek A. Kowalski. Optimal complexity recovery of band- and energy-limited signals
255	--	269	Henryk Wozniakowski. Probabilistic setting of information-based complexity

95	--	120	Ker-I Ko. On the computational complexity of best Chebyshev approximations
121	--	130	Yuly Makovoz. On the Kolmogorov complexity of functions of finite smoothness
131	--	162	Jacek Kuczynski. On the optimal solution of large eigenpair problems
163	--	178	Christopher A. Sikorski, Henryk Wozniakowski. For which error criteria can we solve nonlinear equations?

1	--	0	Joseph F. Traub. From the Editor
2	--	11	Michael Shub, Steve Smale. On the existence of generally convergent algorithms
12	--	43	David Lee, Grzegorz W. Wasilkowski. Approximation of linear functionals on a banach space with a Gaussian measure
44	--	59	Terrance E. Boult, Krzysztof A. Sikorski. Complexity of computing topological degree of lipschitz functions in n dimensions
60	--	77	Judea Pearl, Michael Tarsi. Structuring causal trees
78	--	94	Mario Milanese, Roberto Tempo, Antonio Vicino. Strongly optimal algorithms and optimal information in estimation problems

runs on WebDSL