SIGACT News Complexity Theory Column 99

Abstract

To call these papers in uential would be a comic understatement. In fact, what these papers did is to help set the framework in which theoretical computer science would grow. Reductions are perhaps the most central way in which theoretical computer science relates one problem's complexity to another, and these two papers largely sculpted and powerfully explored the landscape of both polynomial-time and logspace reductions.