Non-deterministic Quasi-Polynomial Time is Average-Case Hard for ACC Circuits

Lijie Chen. Non-deterministic Quasi-Polynomial Time is Average-Case Hard for ACC Circuits. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019. pages 1281-1304, IEEE Computer Society, 2019. [doi]

Abstract

Abstract is missing.