Abstract
As I write this in July 2020, I have no idea what the COVID-19 situation will be like when this September 2020 issue reaches your mailbox or your previewer. My typical advice is to prove exciting theorems. But in these times, all I can share are my hopes: that you'll each be safe and well (and that the medical profes- sion will create an effective vac- cine quickly enough that early in 2021 schools can return to fully in-person teaching); that you'll nd ways to, if a faculty member, help your students thrive even in the hybrid-mode-learning settings they'll probably nd themselves in for the fall semester; and that you'll (while staying careful and safe) nd time to (yes, here it comes) prove exciting theorems.
Recommendations
SIGACT news complexity theory column 36
This current issue's guest column is by Bill Gasarch, and reports on a poll he has conducted on the most famous open question in complexity theory: P=?NP. If Mitsunori Ogihara's prediction that P-vs-NP will not be resolved until the year 3000 is correct,...
SIGACT news complexity theory column 35
I was surprised and delighted at a recent conference when the complexity class Θ2p suddenly popped up in a talk (by Markus Holzer on work by him and Pierre McKenzie) where it is was not exactly something one would have before-hand expected to come into ...
SIGACT news complexity theory column 49
Warmest thanks to Neil Immerman for this issue's column, which is on Progress in Descriptive Complexity. (As you can see in this column, Neil is the rare writer whose italic lines truly deserve the italics.) This issue should reach your hands shortly ...
Comments