An analysis of fixed-point queries on binary trees

DOI10.1016/0304-3975(91)90048-7zbMath0745.68058OpenAlexW1988816718MaRDI QIDQ1183571

Steven Lindell

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90048-7

zbMATH Keywords

binary treesfixed-point queries

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Finite Variable Logics in Descriptive Complexity Theory, Computing on structures, Implicit definability and infinitary logic in finite model theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed-point extensions of first-order logic
• Elementary induction on abstract structures
• Structure and complexity of relational queries
• Course of mathematical logic. Vol. 1: Relation and logical formula. Translation edited by David Louvish
• Relational queries computable in polynomial time
• Second-order and Inductive Definability on Finite Structures
• On the Computational Complexity of Algorithms