17 search results - page 4 / 4 » icalp 1999 |
191
click to vote
STACS
2009
Springer
16 years 2 months ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
208
Voted
ICALP
1998
Springer
15 years 11 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...