Sciweavers

706 search results - page 117 / 142
» On a quasi-ordering on Boolean functions
Sort
View
ICISC
2007
97views Cryptology» more  ICISC 2007»
13 years 9 months ago
New Local Collisions for the SHA-2 Hash Family
The starting point for collision attacks on practical hash functions is a local collision. In this paper, we make a systematic study of local collisions for the SHA-2 family. The p...
Somitra Kumar Sanadhya, Palash Sarkar
ATAL
2010
Springer
13 years 8 months ago
Learning context conditions for BDI plan selection
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. In particular, the so-calle...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...
IJCSS
2007
133views more  IJCSS 2007»
13 years 7 months ago
Synthesis of Read-Once Digital Hardware with Reduced Energy Delay Product
This paper presents a low power driven synthesis framework for the unique class of nonregenerative Boolean Read-Once Functions (BROF). A two-pronged approach is adopted, where the...
P. Balasubramanian, S. Theja
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 8 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
SAT
2010
Springer
165views Hardware» more  SAT 2010»
13 years 6 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman