Publication:4267172
From MaRDI portal
zbMath0959.68523MaRDI QIDQ4267172
Publication date: 6 May 2001
68Q19: Descriptive complexity and finite models
Related Items
The equational complexity of Lyndon's algebra, From a zoo to a zoology: Towards a general theory of graph polynomials, The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis, Ehrenfeucht-Fraïssé Games on Random Structures