Choiceless Polynomial Time on Structures with Small Abelian Colour Classes
type: Item
instance of: scholarly article
title: Choiceless Polynomial Time on Structures with Small Abelian Colour Classes
zbMATH Open document ID: 1426.68106
DOI: 10.1007/978-3-662-44522-8_5
author: Erich Grädel
author: Martin Grohe
author: Wied Pakusa
author: Faried Abu Zaid
published in: Mathematical Foundations of Computer Science 2014
publication date: 2014-10-14T00:00:00Z
Mathematics Subject Classification ID: 68Q19
Mathematics Subject Classification ID: 03C13
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 6355239
MaRDI profile type: Publication
full work available at URL: 978-3-662-44522-8 5
OpenAlex ID: W157368094
cites work: Maximum Matching and Linear Programming in Fixed-Point Logic with Counting
cites work: Affine systems of equations and counting infinitary logic
cites work: Choiceless polynomial time
cites work: On polynomial time computation over unordered structures
cites work: An optimal lower bound on the number of variables for graph identification
cites work: Definability of linear equation systems over groups and rings
cites work: Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
cites work: Finite model theory and its applications.
cites work: Q3912839
cites work: Fixed-point definability and polynomial time on graphs with excluded minors
cites work: Q4124997
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: Choiceless Computation and Symmetry
description: scientific article; zbMATH DE number 6355239