Complexity results for some eigenvector problems
From MaRDI portal
Publication:4521209
DOI10.1080/00207160008805009zbMath0967.65050MaRDI QIDQ4521209
Publication date: 21 August 2001
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160008805009
integer programming; combinatorial optimization; eigenvectors; problem complexity; integer eigenvalue problems
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C27: Combinatorial optimization
65Y20: Complexity and performance of numerical algorithms
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of optimization problems
- Factoring polynomials with rational coefficients
- On the randomized error of polynomial methods for eigenvector and eigenvalue estimates
- The complexity of selecting maximal solutions
- Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
- Bounded Query Classes