77 search results - page 16 / 16 » Partiality and Nondeterminacy in Program Proofs |
ICALP
2007
Springer
13 years 12 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
IPL
2010
13 years 4 months ago
2010
In numerous modern stream ciphers, the internal state consists of a large array of pseudo-random words, and the output key-stream is a relatively simple function of the state. In ...