scientific article; zbMATH DE number 7561605

DOI10.4230/LIPIcs.ICALP.2019.112MaRDI QIDQ5091274

Erich Grädel, Anuj Dawar, Wied Pakusa

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1902.06648

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algebrafinite model theorygraph isomorphismdescriptive complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (2)

Capturing the polynomial hierarchy by second-order revised Krom logic ⋮ Generalizations of \(k\)-dimensional Weisfeiler-Leman stabilization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Affine systems of equations and counting infinitary logic
• An optimal lower bound on the number of variables for graph identification
• Non-isomorphic graphs with cospectral symmetric powers
• The graph isomorphism problem and approximate categories
• Sherali--Adams Relaxations and Indistinguishability in Counting Logics
• Pebble Games with Algebraic Rules
• PEBBLE GAMES AND LINEAR EQUATIONS
• Expander graphs and their applications
• On polynomial time computation over unordered structures
• Descriptive Complexity, Canonisation, and Definable Graph Structure Theory

This page was built for publication: