Complexity results for some eigenvector problems

References

• Chen , Z.-Z. and Toda , S. . The Complexity of Selecting Maximal Solutions. Information and Computation . Extended Abstract in: Proc. 8th IEEE Structure in Complexity Theory Conference . Vol. 119 , pp. 231 – 239 . pp. 313-325, 1993
   Google Scholar
• Cullum , J. and Willoughby , R. 1985 . Lanczos Algorithms for Large Symmetric Eigenvalue Computations Vol. 1 , Boston Birkhäuser
   Google Scholar
• Manzini , G. 1997 . On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimates . Journal of Complexity , 13 : 419 – 456 .
   Google Scholar
• Garey , M. and Johnson , D.S. 1979 . Computers and Intractability - A Guide to the Theory of NP-Completeness , New York : Freeman, W.H .
   Google Scholar
• Golub , G. and Van Loan , C. 1993 . Matrix Computations , Baltimore, Md : Johns Hopkins University Press .
   Google Scholar
• Hastad , J. , Just , B. , Lagarias , J. and Schnorr , C. 1989 . Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers . SIAM Journal of Computing , 18 ( 5 ) : 859 – 881 . Extended Abstract in: Proc, STACS-86, LNCS 210, pp. 105-118, (1986)
   Google Scholar
• Johnson , D.S. 1990 . “ A Catalog of Complexity Classes ” . In Handbook of Theoretical Computer Science Edited by: van Leeuwen , J. Elsevier
   Google Scholar
• Krentel , M. 1988 . The Complexity of Optimization Problems . J. Computer and System Sciences , 36 : 490 – 509 .
   Google Scholar
• Lenstra , A. and Lovász , L. Jr . 1982 . Factoring Polynomials with Rational Coefficients . Mathematische Annalen , 21 : 515 – 534 .
   Web of Science ®Google Scholar
• Wagner , K. 1990 . Bounded Query Classes . SIAM Journal of Computing , 19 ( 5 ) : 833 – 846 .
   Google Scholar
• Yokoyama , K. and Takeshima , T. 1993 . “ On Hensel Construction of Eigenvalues and Eigenvectors of Matrices with Polynomial Entries ” . In Proc. ACM-ISSAC'93, Kiev,Ukraine , 218 – 224 . ACM .
   Google Scholar