2333 search results - page 41 / 467 » Recursive Computational Depth |
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
TCS
2010
13 years 2 months ago
2010
BIRTHDAY
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is ess...
ENTCS
2006
13 years 8 months ago
2006
zing Mutually Referential Abstract Objects: The Value Recursion Challenge Don Syme 1 Microsoft Research, Cambridge, U.K. Mutual dependencies between objects arise frequently in pr...
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...