scientific article; zbMATH DE number 2063224
From MaRDI portal
Publication:4460840
zbMath1044.03025MaRDI QIDQ4460840
Publication date: 29 March 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Constructive and recursive analysis (03F60) Length, area, volume, other geometric measure theory (28A75) Fractals (28A80) Complexity of computation (including implicit computational complexity) (03D15) Higher-type and set recursion theory (03D65)
Related Items (3)
Computational unsolvability of domains of attraction of nonlinear systems ⋮ On the complexity of computing the logarithm and square root functions on a complex domain ⋮ In Memoriam: Ker-I Ko (1950–2018)
This page was built for publication:
