4255 search results - page 274 / 851 » On Learning Boolean Functions |
201
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
171
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
173
click to vote
FPL
2008
Springer
15 years 8 months ago
2008
Springer
In many applications, subsequent data manipulations differ only in a small set of parameter values. Because of their reconfigurability, FPGAs (Field Programmable Gate Arrays) can ...
174
click to vote
ICAI
2007
15 years 8 months ago
2007
Biomolecular networks dynamically respond to stimuli and implement cellular function. Understanding these dynamic changes is the key challenge for cell biologists. As biomolecular...
160
click to vote
ICISC
2007
15 years 8 months ago
2007
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...