Succinct Permanent is NEXP-hard with Many Hard Instances

Shlomi Dolev, Nova Fandina, Dan Gutfreund. Succinct Permanent is NEXP-hard with Many Hard Instances. Electronic Colloquium on Computational Complexity (ECCC), 19:86, 2012. [doi]

Abstract

Abstract is missing.