PMSP - Quasi-random boolean functions, and inapproximability - Ryan O'Donnell
Ryan O'Donnell Carnegie Mellon University June 17, 2010 For more videos, visit http://video.ias.edu
From playlist Mathematics
From playlist Week 1 2015 Shorts
Analysis of Boolean Functions on Association Schemes - Yuval Filmus
Yuval Filmus Member, School of Mathematics September 23, 2014 More videos on http://video.ias.edu
From playlist Mathematics
Recursive Functions (Discrete Math)
This video introduces recursive formulas.
From playlist Functions (Discrete Math)
Using Boolean in Python (Python Tutorial #11)
Using Boolean in Python - let's go! This entire series in a playlist: https://goo.gl/eVauVX Also, keep in touch on Facebook: https://www.facebook.com/entercsdojo And Twitter: https://twitter.com/ykdojo
From playlist Python Tutorials for Absolute Beginners by CS Dojo
Define linear functions. Use function notation to evaluate linear functions. Learn to identify linear function from data, graphs, and equations.
From playlist Algebra 1
Boolean Algebra: Sample Problems
In this video, I work through some sample problems relating to Boolean algebra. Specific, I work through examples of translating equivalences from logical or set notation to Boolean notation, and also a derivation using Boolean equivalences.
From playlist Discrete Mathematics
Live CEOing Ep 236: Language Design in Wolfram Language
Watch Stephen Wolfram and teams of developers in a live, working, language design meeting. This episode is about Language Design in the Wolfram Language.
From playlist Behind the Scenes in Real-Life Software Design
A Complete Dichotomy Rises from the Capture of Vanishing Signatures - Jin-Yi Cai
Jin-Yi Cai University of Wisconsin November 19, 2012 Holant Problems are a broad framework to describe counting problems. The framework generalizes counting Constraint Satisfaction Problems and partition functions of Graph Homomorphisms. We prove a complexity dichotomy theorem for Holant
From playlist Mathematics
Product Free Sets in Groups - Noam Lifshitz
Workshop on Additive Combinatorics and Algebraic Connections Topic: Product Free Sets in Groups Speaker: Noam Lifshitz AffiliationL Member, School of Mathematics Date: October 28, 2022 A subset of a group is said to be product free if it does not contain the product of two elements in it
From playlist Mathematics
A nearly optimal lower bound on the approximate degree of AC00- Mark Bun
Computer Science/Discrete Mathematics Seminar I Topic: A nearly optimal lower bound on the approximate degree of AC00 Speaker: A nearly optimal lower bound on the approximate degree of AC00 Speaker: Mark Bun Affiliation: Princeton University Date: October 23, 2017 For more videos, pleas
From playlist Mathematics
Boolean function analysis: beyond the Boolean cube (continued) - Yuval Filmus
http://www.math.ias.edu/seminars/abstract?event=129061 More videos on http://video.ias.edu
From playlist Mathematics
Cryptography and Network Security by Prof. D. Mukhopadhyay, Department of Computer Science and Engineering, IIT Kharagpur. For more details on NPTEL visit http://nptel.iitm.ac.in
From playlist Computer - Cryptography and Network Security
Monotone Arithmetic Circuit Lower Bounds Via Communication Complexity - Arkadev Chattopadhyay
Computer Science/Discrete Mathematics Seminar I Topic: Monotone Arithmetic Circuit Lower Bounds Via Communication Complexity Speaker: Arkadev Chattopadhyay Affiliation: Tata Institute of Fundamental Research Date: February 15, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
Live CEOing Ep 595: Language Design in Wolfram Language [PositionLargest, Operator Forms & More]
In this episode of Live CEOing, Stephen Wolfram discusses upcoming improvements and features to the Wolfram Language. If you'd like to contribute to the discussion in future episodes, you can participate through this YouTube channel or through the official Twitch channel of Stephen Wolfram
From playlist Behind the Scenes in Real-Life Software Design
Almost Sharp Sharpness for Boolean Percolation - Barbara Dembin
Topic: Almost Sharp Sharpness for Boolean Percolation Speaker: Barbara Dembin Affiliation: ETH Zurich Date: December 16, 2022 We consider a Poisson point process on Rd with intensity lambda for d =2. On each point, we independently center a ball whose radius is distributed according to s
From playlist Mathematics
Boolean Algebra 2 – Simplifying Complex Expressions
This video follows on from the one about the laws of Boolean algebra. It explains some useful interpretations of the laws of Boolean algebra, in particular, variations of the annulment and distributive laws. It goes on to demonstrate how Boolean algebra can be applied to simplify comple
From playlist Boolean Algebra
The Lambert W Function Introduction
This function comes up as a solution to equations ranging from pure math to quantum physics to biology. In this video, I introduce the concepts behind the function and give some sample calculations. There's lots more to this function, so explore it on your own if you're interested.
From playlist Math
Shirshendu Ganguly (Berkeley) -- Stability and chaos in dynamical last passage percolation (Part 1)
Many complex disordered systems in statistical mechanics are characterized by intricate energy landscapes. The ground state, the configuration with lowest energy, lies at the base of the deepest valley. In important examples, such as Gaussian polymers and spin glass models, the landscape h
From playlist Integrable Probability Working Group