scientific article; zbMATH DE number 1342211

zbMath0934.03048MaRDI QIDQ4263796

Elena Pezzoli

Publication date: 25 April 2000

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

zbMATH Keywords

Ehrenfeucht-Fraïssé gamefinite structuresdeciding the winnerPSPACE complete

Mathematics Subject Classification ID

Applications of game theory (91A80) Complexity of computation (including implicit computational complexity) (03D15) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Related Items (8)

Succinct definitions in the first order theory of graphs ⋮ The first order definability of graphs: Upper bounds for quantifier depth ⋮ On complexity of Ehrenfeucht-Fraïssé games ⋮ Unnamed Item ⋮ Games on Strings with a Limited Order Relation ⋮ Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games ⋮ The first order definability of graphs with separators via the Ehrenfeucht game ⋮ On distinguishing sets of structures by first-order sentences of minimal quantifier rank

This page was built for publication: