scientific article; zbMATH DE number 2115098
From MaRDI portal
Publication:4826736
zbMath1159.68459MaRDI QIDQ4826736
Publication date: 11 November 2004
Full work available at URL: http://www.ams.org/notices/200409/200409-toc.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization ⋮ The dependence of computability on numerical notations ⋮ A framework for real-valued cipher systems ⋮ Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ The real nonnegative inverse eigenvalue problem is NP-hard ⋮ Feferman on Computability ⋮ T for Turing. Machine and, also, uneasiness and desire
This page was built for publication:
