نتایج جستجو برای: lower bound pressure
تعداد نتایج: 1201459 فیلتر نتایج به سال:
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
In this paper, we study a bound on the real roots of a polynomial by Lagrange. From known results in the literature, it follows that Lagrange’s bound is also a bound on the absolute positiveness of a polynomial. A simple O(n logn) algorithm described in Mehlhorn-Ray (2010) can be used to compute the bound. Our main result is that this is optimal in the real RAM model. Our paper explores the tra...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید