Tree canonization and transitive closure

DOI10.1006/inco.1999.2835zbMath1005.03515OpenAlexW2105787964MaRDI QIDQ1854332

Kousha Etessami

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d571655dc1bbd486f4c23c52385881c398d29a56

zbMATH Keywords

Ehrenfeucht-Fraïssé gamedescriptive complexity theorytree isomorphismcounting quantifierstransitive closure operatorlocal orderings

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Related Items (3)

Counting quantifiers, successor relations, and logarithmic space ⋮ Reachability and the power of local ordering ⋮ Inherent complexity of recursive queries

This page was built for publication: Tree canonization and transitive closure