SIGACT news complexity theory column 31
ACM SIGACT News
Real computations with fake numbers
Journal of Complexity
Topological complexity of zero finding with algebraic operations
Journal of Complexity
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On a problem in quantum summation
Journal of Complexity
Optimal algorithms for global optimization in case of unknown Lipschitz constant
Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
On the complexity of parabolic initial-value problems with variable drift
Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
Optimal approximation of elliptic problems by linear and nonlinear mappings II
Journal of Complexity
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model
Image and Vision Computing
A lower bound on complexity of optimization on the Wiener space
Theoretical Computer Science
Simple Monte Carlo and the Metropolis algorithm
Journal of Complexity
Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms
Journal of Approximation Theory
On the computing power of fuzzy Turing machines
Fuzzy Sets and Systems
Are unbounded linear operators computable on the average for Gaussian measures?
Journal of Complexity
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Optimal algorithms for global optimization in case of unknown Lipschitz constant
Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
On the complexity of parabolic initial-value problems with variable drift
Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
The randomized complexity of indefinite integration
Journal of Complexity
Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |