A note on \(\#\mathcal P\)-completeness of NP-witnessing relations (Q976088)
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: A note on \# P-completeness of NP-witnessing relations |
scientific article; zbMATH DE number 5721983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on \(\#\mathcal P\)-completeness of NP-witnessing relations |
scientific article; zbMATH DE number 5721983 |
Statements
A note on \(\#\mathcal P\)-completeness of NP-witnessing relations (English)
0 references
16 June 2010
0 references
computational complexity
0 references
\(\#\mathcal P\)-completeness
0 references
NP
0 references
0.8183015584945679
0 references
0.8027647733688354
0 references
0.7624872326850891
0 references
0.7389542460441589
0 references
