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...
Saved in:
| Published in: | International journal of computer mathematics Vol. 76; no. 1; pp. 59 - 74 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Abingdon
Gordon and Breach Science Publishers
2000
Taylor and Francis |
| Subjects: | |
| ISSN: | 0020-7160, 1029-0265 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 |