Counting computations with formulae: logical characterisations of counting complexity classes (Q6647626)
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: Counting computations with formulae: logical characterisations of counting complexity classes |
scientific article; zbMATH DE number 7953256
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting computations with formulae: logical characterisations of counting complexity classes |
scientific article; zbMATH DE number 7953256 |
Statements
Counting computations with formulae: logical characterisations of counting complexity classes (English)
0 references
3 December 2024
0 references
descriptive complexity
0 references
quantitative logics
0 references
counting problems
0 references
\#P
0 references
