Hence the latter problem is also NP-hard. In the lecture we shall also survey other computationally hard algebraic problems.关键词: NP-hard computational complexity computationally hard algebraic problems finite field geometric-like series linear recurrence sequence zeroes ...
Marc Bezem,Robert Nieuwenhuis,Enric Rodríguez-Carbonell.Hard problems in max-algebra, control theory, hypergraphs and other areas[J]. Information Processing Letters .2009(4)Bezem, M., Nieuwenhuis, R., Rodriguez-Carbonell, E.: Hard problem in max-algebra, control theory, hypergraphs and other ...
We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor possesses a given eigenvalue, singular value, or spectral ...
1 As it is well known, thousands of relevant optimization problems in resource management, network design, sequencing and scheduling, graph theory, algebra, logic, etc., called NP-hard problems, are intrinsically difficult. Currently, only exponential time algorithms are known for their solution and...
aIn the mathematical discipline of linear algebra, a matrix decomposition or matrix factorization is a dimensionality reduction technique that factorizes a matrix into a product of matrices, usually two. There are many different matrix decompositions, each finds use among a particular class of problems...
We show that some problems involving sparse polynomials are NP-hard. For example, it is NP-hard to determine if a sparse polynomial has a root of modulus 1, and it is NP-hard to decide if two sparse polynomials are not relatively prime. Also, we show that a divisibility problem involving...
“Isn’t that usually what happens? I always have problems in the labs.” “You’re not alone. Centuries ago, Newton’s Laws of Motion and Gravity made good predictions for planets, not so good for artillery trajectories. Gunners always had to throw in correction factors because their missil...
Data management is one of the most important problems in grid environments. Most of the efforts in data management in grids have been focused on data repli... F García-Carballeira,J Carretero,A Calderón,... - 《Future Generation Computer Systems》 被引量: 66发表: 2007年 ARBOOK: Developm...
Answer to: Explain the difference between undecidable, NP-complete, and NP-hard problems. By signing up, you'll get thousands of step-by-step...
Computing exact componentwise bounds on solutions of linear systems with interval data is NP-hard SIAM J. Matrix Anal. Appl., 16 (1995), pp. 415-420 CrossrefView in ScopusGoogle Scholar 10 S.M. Rump Solving algebraic problems with high accuracy U. Kulisch, W. Miranker (Eds.), A New...