Introduction to algorithms
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Complexity theory of real functions
Complexity theory of real functions
Complexity and real computation
Complexity and real computation
Modern computer algebra
Computability on subsets of Euclidean space I: closed and compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
Theoretical Computer Science - Special issue on computability and complexity in analysis
ACM Computing Surveys (CSUR)
Computable analysis: an introduction
Computable analysis: an introduction
On Extreme Points of Convex Compact Turing Located Set
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Computability of Linear Equations
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Algebraic Complexity Theory
Effectively open real functions
Journal of Complexity
Computability and the Implicit Function Theorem
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 5.23 |
Many problems in Linear Algebra can be solved by Gaussian Elimination. This famous algorithm applies to an algebraic model of real number computation where operations +, -, *, / and tests like, e.g., A ċ x = b, • determine the spectral resolution of a symmetric matrix B, • and compute a linear subspace's dimension from its Euclidean distance function, provided the rank of A and the number of distinct eigenvalues of B are known. Without such restrictions, the first two problems are shown to be, in general, uncomputable.