joshuagrochow
/
s24-logiccomplexity
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
Spring 2024 Reading Group on Machine-independent complexity and formalization in theorem-provers (short name: logic & complexity)
13 Commits 1 Branch 0 Tags 50 KiB
Go to file
joshuagrochow 43d2b3b081 Updated 3/18 and 4/1 2024-04-02 03:48:11 +00:00
README.md Updated 3/18 and 4/1 2024-04-02 03:48:11 +00:00

README.md

Spring 2024 Reading Group: Machine-independent complexity and formalization in theorem-provers ("Logic & Complexity" for short)

CU Boulder CS Theory

When: Mondays 1:20pm-2:20pm US Mountain Time (click for time zone conversion)

Where: Zoom (link available for participants only)

Prerequisites: some knowledge of complexity theory. Having taking an undergrad or grad course in computational complexity would certainly suffice, but isn't strictly necessary. But definitely more complexity theory than the one week typically seen in an Intro Algorithms course.

We are open to participants with the above background and legitimate interest from anywhere. We currently have participants from CU Boulder (both Theory and PLV), U. Maryland, ENS France, UIUC, and BITS Pilani. Please contact Prof. Grochow if you're interested in joining!

Many of the topics are independent from one another; where there are dependencies we've indicated that in the schedule. If you missed a session or are joining mid-semester, past sessions are recorded and available privately for participants.

Schedule: