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

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q4968381
 
aliases / en / 0aliases / en / 0
 
Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic
description / endescription / en
 
scientific article; zbMATH DE number 7080195
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1440.68110 / rank
 
Normal rank
Property / publication date
 
12 July 2019
Timestamp+2019-07-12T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 12 July 2019 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7080195 / rank
 
Normal rank
Property / zbMATH Keywords
 
color refinement
Property / zbMATH Keywords: color refinement / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: nauty / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: bliss / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Traces / rank
 
Normal rank
Property / arXiv classification
 
cs.LO
Property / arXiv classification: cs.LO / rank
 
Normal rank
Property / arXiv classification
 
cs.CC
Property / arXiv classification: cs.CC / rank
 
Normal rank
Property / arXiv classification
 
math.CO
Property / arXiv classification: math.CO / rank
 
Normal rank

Latest revision as of 10:19, 6 May 2024

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