1819 search results - page 112 / 364 » Computability and Representations of the Zero Set |
77
Voted
COCO
2009
Springer
15 years 4 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...
SBACPAD
2007
IEEE
15 years 4 months ago
2007
IEEE
Code Compression has been used to alleviate the memory requirements as well as to improve performance and/or minimize energy consumption. On the other hand, implementing security ...
ISSAC
2007
Springer
15 years 4 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
ICSOC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. New generation network services must be deployed and managed according to the specific customer requirements. In this context, service providers must devise a way to des...
EUROCRYPT
2008
Springer
14 years 11 months ago
2008
Springer
We study obfuscation of point functions with multibit output and other related functions. A point function with multibit output returns a string on a single input point and zero ev...