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]
@article{DolevFG12,
title = {Succinct Permanent is NEXP-hard with Many Hard Instances},
author = {Shlomi Dolev and Nova Fandina and Dan Gutfreund},
year = {2012},
url = {http://eccc.hpi-web.de/report/2012/086},
researchr = {https://researchr.org/publication/DolevFG12},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {19},
pages = {86},
}