Minghsin University of Science and Technology
Uedu Main Site
Explore Uedu
Student Console
Register as Member/Login
Research Informed Consent Center
Survey Center
UeduGPTs
Aida Learning Companion
Agentic AI
Local AI
Uedu Code
Find an Advisor
Paper Reading
Uedu Note
Uedu Open
Uedu Jupyter
Language Learning
Lingua Writing
My Writing History
Cognomics Test Toolkit
Uedu Finance
Educational Big Data Challenge
Uedu Interdisciplinary General Education
Uedu Physics
Uedu Calculus
Uedu Biology
Uedu Chemistry
Uedu Electronics
Uedu Semiconductor
Uedu AI
Uedu Statistics
Uedu UAV
Teaching Materials
Literature Hall
Taiwan: Four Hundred Years
Uedu Science
Teacher Console
Course Setup
Support & Messages
Uptime Data

UeduGPTs

--

Jupyters

6

Local AI

--

Uedu Code

--

CISOSE26 Local AI Uedu Code UG26
明新科大 AQI 56 26°C PM2.5 10
AI Reply Desktop Notifications

Show a desktop notification when the AI TA finishes replying

Chat Message Notifications

Notify me when classmates post messages in the forum

Sound notification

Play an alert sound whenever there is a new notification

More settings
Account settings Data privacy settings Research Informed Consent Form
Uedu Open / Topics in Combinatorics: Analysis of Boolean Functions
18.218

Topics in Combinatorics: Analysis of Boolean Functions

Prof. Dor Minzer | Spring 2021
Science & Math Mathematics Probability and Statistics
Go to original course
CC BY-NC-SA 4.0
Course introduction
In this course, we will mostly be studying Fourier analysis of Boolean functions, which is a useful tool in theoretical computer science, combinatorics, and more. We will start with basic concepts such as influences, noise sensitivity, and hypercontractivity and some basic results in the area.
Course Information
SourceMIT 開放式課程
DepartmentMathematics
LanguageEnglish
Number of videos0
Course videos (0)
No video materials are available for this Course yet
Go to the original course page to view