Technical Report Column

Abstract

Complexity Theory, Game Theory, and Economics, Tim Roughgarden, TR18-001. Which Distribution Distances are Sublinearly Testable?, Constantinos Daskalakis, Gautam Kamath, John Wright, TR18-002. Proving that prBPP = prP is as hard as \almost" proving that P 6= NP, Roei Tell, TR18-003. Circuit Complexity of Bounded Planar Cutwidth Graph Matching, Aayush Ojha, Raghunath Tewari, TR18-004. Adaptive Boolean Monotonicity Testing in Total In uence Time, C. Seshadhri, Deeparnab Chakrabarty, TR18-005. Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion, Subhash Khot, Dor Minzer, Muli Safra, TR18-006.