Pebble games with algebraic rules

DOI10.1007/978-3-642-31585-5_25MaRDI QIDQ6829219zbMATH OpenFDO

Authors Anuj Dawar, Bjarki Holm

Publication date 1 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31585-5_25

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Descriptive complexity and finite models (68Q19)

Cited in

(4)

• Limitations of game comonads for invertible-map equivalence via homomorphism indistinguishability
• On the descriptive complexity of groups without abelian normal subgroups
• On the descriptive complexity of groups without abelian normal subgroups (extended abstract)
• Separating rank logic from polynomial time

This page was built for publication: Pebble games with algebraic rules

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