4940 search results - page 723 / 988 » On the Complexity of Universal Programs |
171
click to vote
FOSSACS
2007
Springer
16 years 22 days ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
140
click to vote
FSE
2007
Springer
16 years 22 days ago
2007
Springer
We present a practical attack on the Panama hash function that generates a collision in 26 evaluations of the state updating function. Our attack improves that of Rijmen and cowork...
152
click to vote
ICALP
2007
Springer
16 years 22 days ago
2007
Springer
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
172
click to vote
ICALP
2007
Springer
16 years 22 days ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
181
click to vote
ICN
2007
Springer
16 years 21 days ago
2007
Springer
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...