Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: NEXP-Hard with Many Hard InstancesShlomi Dolev, Nova Fandina, Dan Gutfreund. ciac 2013: 183-196 [doi] Holographic Computation of Balanced Succinct Permanent InstancesShlomi Dolev, Nova Fandina, Joseph Rosen. osc 2011: 100-112 [doi] Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent)Amir Anter, Shlomi Dolev. nc, 9(4):891-902, 2010. [doi]
The following publications are possibly variants of this publication: