University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Influences and Boolean functions representations

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Influences and Boolean functions representations

Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani .

Discrete Analysis

More than twenty years ago the important work of Kahn, Kalai and Linial gave general bounds on the influence of variables in arbitrary Boolean functions over the discrete hypercube. In theoretical computer science, though, often one is interested in particular types of “simple” Boolean functions such as constant-depth circuits, decision trees, low-degree polynomial threshold functions, etc. This additional structure raises the possibility that refined influence bounds can be obtained, and indeed it turns out that this is sometimes the case. This talk will give an overview of several such results and their applications, with an emphasis on currently open questions and directions for future work.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cyber Cafe, Chemistry, Department of William Mong Hall, Sidney Sussex College, Cambridge CB2 3HU https://ukri.zoom.us/j/91008981392;BAS Seminar Room 330b

Other talks

Title to be confirmed A scientists guide to the art of radiation therapy and Neurosurgery for the oncologist Group Work Title TBC Title to be confirmed Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity