# Events by date

## Wednesday, April 14, 2021

### PhD Seminar • Artificial Intelligence — A Score-and-Search Approach to Learning Bayesian Networks with Noisy-OR Relations

Wednesday, April 14, 2021 — 11:00 AM EDT

Please note: This PhD seminar will be given online.

Charupriya Sharma, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Peter van Beek

### Seminar • Algorithms and Complexity — An Optimal Separation of Randomized and Quantum Query Complexity

Wednesday, April 14, 2021 — 1:00 PM EDT

Please note: This seminar will be given online.

Pei Wu, Computer Science Department
University of California, Los Angeles

We prove that for every decision tree, the absolute values of the Fourier coefficients of given order $\ell\geq1$ sum to at most $c^{\ell}\sqrt{\binom{d}{\ell}(1+\log n)^{\ell-1}},$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant. This bound is essentially tight and settles a conjecture due to Tal (arxiv 2019; FOCS 2020).

### November 2021

S M T W T F S
31
2
6
7
8
9
10
13
14
16
18
20
21
23
24
25
27
28
29
30
1
2
3
4
1. 2022 (20)
1. February (2)
2. January (18)
2. 2021 (210)
1. December (21)
2. November (13)
3. October (12)
4. September (21)
5. August (20)
6. July (17)
7. June (11)
8. May (16)
9. April (27)
10. March (20)
11. February (13)
12. January (19)
3. 2020 (217)
4. 2019 (255)
5. 2018 (217)
6. 2017 (36)
7. 2016 (21)
8. 2015 (36)
9. 2014 (33)
10. 2013 (23)
11. 2012 (4)
12. 2011 (1)
13. 2010 (1)
14. 2009 (1)
15. 2008 (1)