45 search results - page 2 / 9 » Diagonal Circuit Identity Testing and Lower Bounds |
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
ICALP
2010
Springer
14 years 13 days ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
MP
2006
13 years 7 months ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
CORR
2010
Springer
13 years 2 months ago
2010
Springer