On winning strategies in Ehrenfeucht-Fraïssé games
type: Item
instance of: scholarly article
title: On winning strategies in Ehrenfeucht-Fraïssé games
zbMATH Open document ID: 0903.68079
DOI: 10.1016/S0304-3975(96)00015-1
author: Ronald Fagin
author: Sanjeev Arora
published in: Theoretical Computer Science
publication date: 1998-10-22T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1213158
zbMATH Keywords: computational complexity
zbMATH Keywords: descriptive complexity
MaRDI profile type: Publication
cites work: Reachability is harder for directed than for undirected finite graphs
cites work: Q3941433
cites work: Structure and complexity of relational queries
cites work: Second-order and Inductive Definability on Finite Structures
cites work: An application of games to the completeness problem for formalized theories
cites work: Q4052071
cites work: Q4058132
cites work: Monadic generalized spectra
cites work: Degrees of acyclicity for hypergraphs and relational database schemes
cites work: On monadic NP vs monadic co-NP
cites work: Q3230355
cites work: Q3666827
cites work: Q4198056
cites work: Q5551141
cites work: Relational queries computable in polynomial time
cites work: Q3830533
cites work: Q5537599
cites work: On the definability of properties of finite graphs
description: scientific article; zbMATH DE number 1213158