131 search results - page 22 / 27 » The complexity of Boolean functions from cryptographic viewp... |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
SAT
2010
Springer
13 years 8 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
BMCBI
2007
13 years 10 months ago
2007
Background: Domains are the basic functional units of proteins. It is believed that protein-protein interactions are realized through domain interactions. Revealing multi-domain c...
EUROPKI
2009
Springer
13 years 8 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
BMCBI
2008
13 years 10 months ago
2008
Background: Structural alignment of RNAs is becoming important, since the discovery of functional non-coding RNAs (ncRNAs). Recent studies, mainly based on various approximations ...