Succinct Permanent Is NEXP-Hard with Many Hard Instances (Q4924648)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Succinct Permanent Is NEXP-Hard with Many Hard Instances |
scientific article; zbMATH DE number 6172005
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Succinct Permanent Is NEXP-Hard with Many Hard Instances |
scientific article; zbMATH DE number 6172005 |
Statements
Succinct Permanent Is NEXP-Hard with Many Hard Instances (English)
0 references
7 June 2013
0 references
0.84099716
0 references
0 references
0.82420075
0 references
0.82051384
0 references
0.8198868
0 references
0.81510377
0 references
0.8140421
0 references
