Two-closures of supersolvable permutation groups in polynomial time Ilia PonomarenkoAndrey Vasil’ev OriginalPaper 24 June 2020 Article: 5
Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation Or Meir OriginalPaper 06 June 2020 Article: 4
Correction to: Communication complexity with small advantage Thomas Watson Correction 30 May 2020 Article: 3
On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs Hiro ItoAreej KhouryIlan Newman OriginalPaper 20 January 2020 Article: 1