Enumerative counting is hard (Q1822963)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4113996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerative counting is hard |
scientific article; zbMATH DE number 4113996 |
Statements
Enumerative counting is hard (English)
0 references
1989
0 references
enumerative counting
0 references
polynomial-time machine
0 references
enumerator
0 references
0.8786231875419617
0 references
0.8501554131507874
0 references
0.7744307518005371
0 references
