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]

Authors

Shlomi Dolev

This author has not been identified. Look up 'Shlomi Dolev' in Google

Nova Fandina

This author has not been identified. Look up 'Nova Fandina' in Google

Dan Gutfreund

This author has not been identified. Look up 'Dan Gutfreund' in Google