Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs |
scientific article |
Statements
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (English)
0 references
28 March 2008
0 references
finite model theory
0 references
descriptive complexity
0 references
choiceless polynomial time
0 references
counting quantifiers
0 references
