نتایج جستجو برای: polynomial problems

تعداد نتایج: 665436  

Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...

2005
Zhixiang Chen Bin Fu Yong Tang Binhai Zhu

In this paper, we study the following disc covering problem: Given a set of discs of 6 various radii on the plane, find a subset of discs to maximize the area covered by exactly one 7 disc. This problem originates from the application in digital halftoning, with the best known 8 approximation factor being 5.83 (Asano et al., 2004). We show that if the maximum radius 9 is no more than a constant...

Journal: :J. Comput. Syst. Sci. 2015
Michael Etscheid Stefan Kratsch Matthias Mnich Heiko Röglin

Kernelization is a formalization of efficient preprocessing for NP-hard problems using the framework of parameterized complexity. Among open problems in kernelization it has been asked many times whether there are deterministic polynomial kernelizations for Subset Sum and Knapsack when parameterized by the number n of items. We answer both questions affirmatively by using an algorithm for compr...

Journal: :J. Comput. Syst. Sci. 2009
Hans L. Bodlaender Rodney G. Downey Michael R. Fellows Danny Hermelin

Kernelization is a central technique used in parameterized algorithms, and in other techniques for coping with NP-hard problems. In this paper, we introduce a new method which allows us to show that many problems do not have polynomial size kernels under reasonable complexity-theoretic assumptions. These problems include kPath, k-Cycle, k-Exact Cycle, k-Short Cheap Tour, k-Graph Minor Order Tes...

Journal: :Math. Log. Q. 1995
Stanley Burris

We have two polynomial time results for the uniform word problem for a quasivariety Q: (a) The uniform word problem for Q can be solved in polynomial time iff one can find a certain congruence on finite partial algebras in polynomial time. (b) Let Q* be the relational class determined by Q. If any universal Horn class between the universal closure S(Q*) and the weak embedding closure S(Q*) of Q...

Journal: :SIAM Journal on Matrix Analysis and Applications 2001

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید