1552 search results - page 97 / 311 » On the Complexity of Constant Propagation |
147
click to vote
TCC
2010
Springer
15 years 4 months ago
2010
Springer
Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (...
147
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
119
click to vote
ISCAS
2007
IEEE
16 years 20 days ago
2007
IEEE
— A raytracer calculates how a camera would observe a potentially complex scene consisting of numerous objects and light sources. If all the objects are modeled by n primitives, ...
147
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
136
click to vote
SIAMMA
2010
15 years 1 months ago
2010
We consider the inverse problem of determining the spherically symmetric index of refraction n(r) from a knowledge of the corresponding transmission eigenvalues (which can be deter...