On the power of counting the total number of computation paths of NPTMs (Q6636085)
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 power of counting the total number of computation paths of NPTMs |
scientific article; zbMATH DE number 7941774
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the power of counting the total number of computation paths of NPTMs |
scientific article; zbMATH DE number 7941774 |
Statements
On the power of counting the total number of computation paths of NPTMs (English)
0 references
12 November 2024
0 references
counting complexity
0 references
\#\textsf{P}
0 references
number of perfect matchings
0 references
gap-definable classes
0 references
0 references
0 references
