1695 search results - page 26 / 339 » Linear, Polynomial or Exponential |
101
Voted
COCO
2009
Springer
15 years 7 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...
108
Voted
ICDT
1995
ACM
15 years 4 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
132
click to vote
ECCC
2011
14 years 7 months ago
2011
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
This note studies nonlinear systems evolving on manifolds with a finite number of asymptotically stable equilibria and a Lyapunov function which strictly decreases outside equilibr...
86
Voted
TIT
2008
15 years 18 days ago
2008
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...