Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 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
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic |
scientific article; zbMATH DE number 7080195 |
|
Statements
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (English)
0 references
23 April 2018
0 references
12 July 2019
0 references
Weisfeiler-Leman algorithm
0 references
counting quantifiers
0 references
first-order logic
0 references
quantifier depth
0 references
color refinement
0 references
cs.LO
0 references
cs.CC
0 references
math.CO
0 references
0 references
0.99944925
0 references
0.93061185
0 references
0.9046804
0 references
0.8774858
0 references
0.8722806
0 references
0.87108207
0 references
0.8708741
0 references
0.86920786
0 references
0 references
