Tailoring recursion for complexity

DOI10.1007/3-540-58201-0_62zbMath1418.68096OpenAlexW2593186098MaRDI QIDQ4632420

Erich Grädel, Yuri Gurevich

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_62

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Datalog extensions for database queries and updates
• Capturing complexity classes by fragments of second-order logic
• An algebra and a logic for \(NC^ 1\)
• A logic for constant-depth circuits
• Functions and functional on finite systems

This page was built for publication: Tailoring recursion for complexity