13621 search results - page 104 / 2725 » Computability and Complexity in Self-assembly |
159
Voted
FOCS
1991
IEEE
15 years 8 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
116
Voted
IBMRD
2011
14 years 11 months ago
2011
143
Voted
FCT
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they hav...
295
Voted
ASIACRYPT
2011
Springer
14 years 5 months ago
2011
Springer
Since Rijndael was chosen as the Advanced Encryption Standard, improving upon 7-round attacks on the 128-bit key variant or upon 8-round attacks on the 192/256-bit key variants has...
118
click to vote
MFCS
1990
Springer
15 years 9 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...