2693 search results - page 87 / 539 » On Computing Complex Navigation Functions |
ICISC
2007
13 years 11 months ago
2007
We present a collision attack on the hash function HAS-160 reduced to 53-steps. The attack has a complexity of about 235 hash computations. The attack is based on the work of Cho e...
CSL
2007
Springer
14 years 4 months ago
2007
Springer
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....
ECCC
2010
13 years 8 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
SIGGRAPH
2010
ACM
14 years 1 months ago
2010
ACM
We present a visual exploration tool that lets biologists navigate through complex bat wing geometries by combining a novel modeling method and an interactive visualization approa...
ENTCS
2007
13 years 10 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...