38 search results - page 6 / 8 » Read-Once Polynomial Identity Testing |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
— This work is focused on the design of a rotor speed regulator for small-scale helicopters. A nominal model identification for the main rotor is performed using a hybrid proced...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In their paper on the "chasm at depth four", Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2o(m) al...
ASPDAC
1998
ACM
14 years 2 days ago
1998
ACM
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...