Sciweavers

1383 search results - page 26 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
COMPSAC
2004
IEEE
15 years 1 months ago
On the Complexity of Finding Emerging Patterns
Emerging patterns have been studied as a useful type of pattern for the diagnosis and understanding of diseases based on the analysis of gene expression profiles. They are useful ...
Lusheng Wang, Hao Zhao, Guozhu Dong, Jianping Li
MICS
2007
57views more  MICS 2007»
14 years 9 months ago
Pseudozero Set of Real Multivariate Polynomials
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...
Stef Graillat
COCOON
2007
Springer
15 years 4 months ago
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
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...
Maurice J. Jansen, Kenneth W. Regan
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
15 years 10 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
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 ...
Zeev Dvir, Amir Shpilka
TCS
2008
14 years 10 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi