Experimental descriptive complexity

DOI10.1007/978-3-642-29485-3_3MaRDI QIDQ2897942zbMATH OpenOpenAlexFDO

Authors Charles Jordan, Neil Immerman, Marco L. Carmosino

Publication date 16 July 2012

Published in Logic and Program Semantics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29485-3_3

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1254648
• scientific article; zbMATH DE number 1424025
• On the Descriptive Complexity of Linear Algebra
• scientific article; zbMATH DE number 4106276
• Computational complexity and the expressive power of logics

Cited in

(6)

• A logical description of priority separable games
• Work-sensitive dynamic complexity of formal languages
• Defining recursive predicates in graph orders
• Definability in first order theories of graph orderings
• scientific article; zbMATH DE number 7199582 (Why is no real title available?)
• scientific article; zbMATH DE number 7439745 (Why is no real title available?)

Describes a project that uses

Uses Software

• DescriptiveEnvironment

This page was built for publication: Experimental descriptive complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897942)