Succinct Permanent Is NEXP-Hard with Many Hard Instances
| Image |  |
|---|---|
| Description | article by Shlomi Dolev et al published 2013 in Lecture Notes in Computer Science |
| Author/s |
author: Dan Gutfreund |
| Publication date | 2013 |
| Language | English |
| Country of origin | |
| Wikipedia link | |
| Copyright status | |
| Missing/wrong data? | Edit Wikidata item |