Descriptive complexity of graph spectra (Q2273011)

From MaRDI portal
Revision as of 09:51, 6 May 2024 by EloiFerrer (talk | contribs) (‎Merged Item from Q2820694)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6625887
  • Descriptive Complexity of Graph Spectra
Language Label Description Also known as
English
Descriptive complexity of graph spectra
scientific article; zbMATH DE number 6625887
  • Descriptive Complexity of Graph Spectra

Statements

title
Descriptive complexity of graph spectra (English)
0 references
Descriptive Complexity of Graph Spectra (English)
0 references
zbMATH Open document ID
1430.68119
0 references
1430.68118
0 references
author
Anuj Dawar
0 references
Simone Severini
0 references
Octavio Zapata
0 references
publication date
18 September 2019
0 references
9 September 2016
0 references
Mathematics Subject Classification ID
68Q19
0 references
03C13
0 references
03C80
0 references
05C50
0 references
05C60
0 references
05E30
0 references
zbMATH DE Number
7106325
0 references
6625887
0 references
zbMATH Keywords
descriptive complexity
0 references
finite model theory
0 references
spectral graph theory
0 references
counting logics
0 references
isomorphism problems
0 references
strongly regular graphs
0 references
algebraic graph theory
0 references
isomorphism approximations
0 references
OpenAlex ID
W2939442208
0 references
W3101563534
0 references
arXiv ID
1603.07030
0 references
 
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2273011&oldid=34071459"
Powered by MediaWiki