A Course in Discrete Structures
An undergraduate course in basic Discrete Mathematics, with applications in Cryptography and Game Theory.
Publication date: 31 Aug 2011
ISBN-10: n/a
ISBN-13: n/a
Paperback: 204 pages
Views: 12,488
Type: Lecture Notes
Publisher: n/a
License: n/a
Post time: 14 Jul 2016 03:30:00
A Course in Discrete Structures
An undergraduate course in basic Discrete Mathematics, with applications in Cryptography and Game Theory.
Publication date: 31 Aug 2011
ISBN-10: n/a
ISBN-13: n/a
Paperback: 204 pages
Views: 12,488
Document Type: Lecture Notes
Publisher: n/a
License: n/a
Post time: 14 Jul 2016 03:30:00
Pass and Tseng wrote:Why study discrete mathematics in computer science? It does not directly help us write programs. At the same time, it is the mathematics underlying almost all of computer science.
Here are a few examples:
• Designing high-speed networks and message routing paths.
• Finding good algorithms for sorting.
• Performing web searches.
• Analysing algorithms for correctness and efficiency.
• Formalizing security requirements.
• Designing cryptographic protocols.
Tweet
About The Author(s)
Rafael Pass is an Associate Professor in the Department of Computer Science at Cornell University and at Cornell NYC Tech. Professor Pass' research interests are in the field of Cryptography and its interplay with Computational Complexity and Game Theory.
Rafael Pass is an Associate Professor in the Department of Computer Science at Cornell University and at Cornell NYC Tech. Professor Pass' research interests are in the field of Cryptography and its interplay with Computational Complexity and Game Theory.
Wei-Lung Dustin Tseng is a PhD student in the Department of Computer Science at Cornell University. His main interests are in the field of theoretical cryptography.
Wei-Lung Dustin Tseng is a PhD student in the Department of Computer Science at Cornell University. His main interests are in the field of theoretical cryptography.