1998 search results - page 42 / 400 » Complexity of the Cover Polynomial |
MICS
2007
13 years 9 months ago
2007
The pseudozero set of a system P of polynomials in n variables is the subset of Cn consisting of the union of the zeros of all polynomial systems Q that are near to P in a suitable...
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
COLCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
STOC
2005
ACM
14 years 10 months ago
2005
ACM
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...