Primary tabs
All day |
|
Before 1am
1am
2am
3am
4am
5am
6am
7am
8am
9am
10am
11am
12pm
1pm
2pm
3pm
4pm
5pm
6pm
7pm
8pm
9pm
10pm
11pm
|
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials –
Robin Kothari (Microsoft Research)
4:00 pm – 5:00 pm |
Please also consider the following event calendars
UC Berkeley Statistics Department
UC Berkeley Electrical Engineering & Computer Sciences Department
Mathematical Sciences Research Institute
International Computer Science Institute