Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884)

From MaRDI portal
Revision as of 10:19, 6 May 2024 by EloiFerrer (talk | contribs) (‎Merged Item from Q4968381)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7080195
  • Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic
Language Label Description Also known as
English
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic
scientific article; zbMATH DE number 7080195
  • Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic

Statements

Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (English)
0 references
0 references
0 references
0 references
0 references
23 April 2018
0 references
12 July 2019
0 references
0 references
0 references
0 references
0 references
0 references
0 references
Weisfeiler-Leman algorithm
0 references
counting quantifiers
0 references
first-order logic
0 references
quantifier depth
0 references
color refinement
0 references
0 references
0 references
0 references
0 references
0 references
cs.LO
0 references
cs.CC
0 references
math.CO
0 references