Discrete Mathematics

Description

Welcome to the Leanpub Launch video for Discrete Mathematics: with applications in Computer Science https://leanpub.com/discrete-mathematics-cs by Alexander S. Kulikov! 0:00 Introduction: Sasha describes his background in algorithms, complexity, and his role at JetBrains 0:47 Who the book is for: first-year CS students and anyone interested in learning discrete mathematics basics 1:33 Special features of the book: illustrations, interactive puzzles, and Python code snippets 2:19 Len shares his personal story of first encountering mathematical proofs at university 3:08 Sasha on the importance of understanding the difference between intuition and formal proof 3:53 The Coursera specialization on discrete mathematics and its first course on what a proof is 4:39 Coursera's marketing advice to rename the proof course to 'mathematical thinking' because students fear proofs 5:28 Sasha's goal: helping students enjoy proofs and feel capable of discovering them independently 6:13 Closing remarks: the book's proven track record with first-year university students 6:13 Sasha thanks LeanPub as a platform he enjoys using for publishing the textbook About the Book This textbook accompanies our year-long course on Discrete Mathematics in the Computer Science and Artificial Intelligence B.S. program at Neapolis University Pafos. It covers all the classical topics: combinatorics, graph theory, probability theory, logic, and set theory. It also presents many applications of these topics in different areas of computer science: artificial intelligence, bioinformatics, coding theory, complexity theory, cryptography, data structures and algorithms, programming language theory, and formal methods. Together, we will see many ways to use these ideas in practice. Each chapter also includes advanced topics that are not covered in standard discrete mathematics courses. About the Author Alexander S. Kulikov is a researcher at JetBrains where he is also the Head of the Algorithms and Complexity Lab. At Neapolis University Pafos, he is the Head of the Computer Science and Artificial Intelligence BS program. His research interests include algorithms and complexity theory. He co-authored online courses "Data Structures and Algorithms" and "Introduction to Discrete Mathematics for Computer Science" that are available at Coursera and edX. About the Author Nikolai Chukhin is a Research Assistant at the Algorithms and Complexity Theory Lab at JetBrains Research. His research interests include computational complexity and fine-grained complexity. He graduated with honors from Saint Petersburg University and Neapolis University Pafos and has taught graph theory at Neapolis University Pafos. Personal website Thank you for watching, please like and leave a comment, we'd love to hear from you! Please Subscribe and Follow! YouTube: https://www.youtube.com/leanpub X: https://x.com/leanpub Instagram: https://www.instagram.com/leanpub Facebook: https://www.facebook.com/leanpub Create Your Own Leanpub Book! You can create your own book anytime here: https://leanpub.com/create/book Here's the tutorial showing how to write and publish a Leanpub book in your browser (it's free!): https://help.leanpub.com/en/articles/2932527-getting-started-writing-a-book-in-leanpub-s-web-browser-writing-mode If you're a Leanpub author and you'd like to submit your own Launch video for us to publish, or if you'd like to record a Launch video with Len, please go here: https://leanpub.com/launch. #books #leanpublishing #selfpublishing #leanpub #writing #mathematics #ai #computerscience #graphtheory #DiscreteMathematics #ComputerScience #MathematicalProofs #AlgorithmsAndComplexity #CombinatoricsAndGraphTheory