The SCEAS System
Navigation Menu

Journals in DBLP

J. Complexity
1995, volume: 11, number: 2

  1. Henry P. Wynn, Anatoly A. Zhigljavsky
    Achieving the Ergodically Optimal Convergence Rate for a One-Dimensional Minimization Problem. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1995, v:11, n:2, pp:196-226 [Journal]
  2. Boleslaw Z. Kacewicz, Marek A. Kowalski
    Recovering Linear Operators from Inaccurate Data. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1995, v:11, n:2, pp:227-239 [Journal]
  3. Leszek Plaskota
    Average Complexity for Linear Problems in a Model with Varying Information Noise. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1995, v:11, n:2, pp:240-264 [Journal]
  4. Ker-I Ko
    Computational Complexity of Fixed Points and Intersection Points. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1995, v:11, n:2, pp:265-292 [Journal]
  5. Vladimir N. Temlyakov
    An Inequality for Trigonometric Polynomials and Its Application for Estimating the Entropy Numbers. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1995, v:11, n:2, pp:293-307 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002