331 search results - page 8 / 67 » New Results on the Pseudorandomness of Some Blockcipher Cons... |
VAMOS
2009
Springer
14 years 3 months ago
2009
Springer
In software product line engineering, feature models enable to automate the generation of productspecific models in conjunction with domain “base models” (e.g. UML models). T...
MOC
2002
13 years 8 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
SAT
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
IPL
2002
13 years 8 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...