On the complexity of the permanent in various computational models (Q2013543)
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: On the complexity of the permanent in various computational models |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the permanent in various computational models |
scientific article |
Statements
On the complexity of the permanent in various computational models (English)
0 references
8 August 2017
0 references
0 references
0.8124710321426392
0 references
0.8108795285224915
0 references
