Monotone complexity from a logical viewpoint
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Anupam Das.
Following on from Gianluca’s lab lunch series, I want to speak about a line of work on characterising monotone computation using notions from mathematical logic, in particular recursion theory and proof theory.
[NB: this talk will be physical only]
This talk is part of the Lab Lunch series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|