Efficient Protocols for Set Membership and Range Proofs
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Additive combinatorics and discrete logarithm based range protocols
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
| Hi-index | 0.00 |
A method of presenting optimization to first-semester calculus students is demonstrated. The method is based on the Lagrange multiplier approach, and the geometry of a given problem becomes the central focus of the effort to find a solution. The method proposed here deviates from the traditional approach in that the student is asked to examine a constrained optimization problem and the geometry of the problem remains the central theme.