Complexity results for some eigenvector problems

We consider the computation of eigenvectors over the integers, where each component x i satisfies for an integer b. We address various problems in this context, and analyze their computational complexity. We find that different problems are complete for the complexity classes Applying the results, f...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of computer mathematics Jg. 76; H. 1; S. 59 - 74
Hauptverfasser: Eiter, Thomas, Gottlob, Georg
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Abingdon Gordon and Breach Science Publishers 2000
Taylor and Francis
Schlagworte:
ISSN:0020-7160, 1029-0265
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider the computation of eigenvectors over the integers, where each component x i satisfies for an integer b. We address various problems in this context, and analyze their computational complexity. We find that different problems are complete for the complexity classes Applying the results, finding bounded solutions of a Diophantine equation is shown to be intractable.
ISSN:0020-7160
1029-0265
DOI:10.1080/00207160008805009