Computer Science – Computational Complexity
Scientific paper
2008-11-24
Computer Science
Computational Complexity
added Sections 5.1 and 5.2
Scientific paper
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f:A->B, additional structural information about the input x in A (that is any kind of promise that x belongs to a certain subset A' of A) should be taken advantage of. Some examples from real number computation show that such discrete advice can even make the difference between computability and uncomputability. We turn this into a both topological and combinatorial complexity theory of information, investigating for several practical problems how much advice is necessary and sufficient to render them computable. Specifically, finding a nontrivial solution to a homogeneous linear equation A*x=0 for a given singular real NxN-matrix A is possible when knowing rank(A)=0,1,...,N-1; and we show this to be best possible. Similarly, diagonalizing (i.e. finding a BASIS of eigenvectors of) a given real symmetric NxN-matrix is possible when knowing the number of distinct eigenvalues: an integer between 1 and N (the latter corresponding to the nondegenerate case). And again we show that N-fold (i.e. roughly log N bits of) additional information is indeed necessary in order to render this problem (continuous and) computable; whereas for finding SOME SINGLE eigenvector of A, providing the truncated binary logarithm of the least-dimensional eigenspace of A--i.e. Theta(log N)-fold advice--is sufficient and optimal.
Ziegler Martin
No associations
LandOfFree
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-643822