2 search results - page 1 / 1 » Wooden Geometric Puzzles: Design and Hardness Proofs |
FUN
2007
Springer
13 years 11 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
ASIACRYPT
2009
Springer
13 years 12 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...