A note on the non-NP-hardness of approximate lattice problems under general Cook reductions

Complexity theory

ACM SIGACT News

The NP-completeness column

ACM Transactions on Algorithms (TALG)

Lattice problems in NP ∩ coNP

Journal of the ACM (JACM)

Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword

Computational Complexity

On promise problems: a survey

Theoretical Computer Science