scientific article; zbMATH DE number 1343480

zbMath0959.68523MaRDI QIDQ4267172

No author found.

Publication date: 6 May 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitydescriptive complexity

Mathematics Subject Classification ID

Descriptive complexity and finite models (68Q19)

Related Items (10)

Unnamed Item ⋮ On the complexity of inverse semigroup conjugacy ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The equational complexity of Lyndon's algebra ⋮ The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis ⋮ From a zoo to a zoology: Towards a general theory of graph polynomials ⋮ Ehrenfeucht-Fraïssé Games on Random Structures ⋮ Counting of Teams in First-Order Team Logics

This page was built for publication: