Choiceless Polynomial Time on Structures with Small Abelian Colour Classes (Q2922002): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-44522-8_5
+Normal rank
@@ Property / OpenAlex ID @@
+W157368094
@@ Property / OpenAlex ID: W157368094 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum Matching and Linear Programming in Fixed-Point Logic with Counting
+Normal rank
@@ Property / cites work @@
+Affine systems of equations and counting infinitary logic
+Normal rank
@@ Property / cites work @@
+Choiceless polynomial time
@@ Property / cites work: Choiceless polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+On polynomial time computation over unordered structures
+Normal rank
@@ Property / cites work @@
+An optimal lower bound on the number of variables for graph identification
+Normal rank
@@ Property / cites work @@
+Definability of linear equation systems over groups and rings
+Normal rank
@@ Property / cites work @@
+Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
+Normal rank
@@ Property / cites work @@
+Finite model theory and its applications.
@@ Property / cites work: Finite model theory and its applications. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3912839
@@ Property / cites work: Q3912839 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-point definability and polynomial time on graphs with excluded minors
+Normal rank
@@ Property / cites work @@
+Q4124997
@@ Property / cites work: Q4124997 / rank @@
+Normal rank
@@ Property / cites work @@
+Isomorphism of graphs of bounded valence can be tested in polynomial time
+Normal rank
@@ Property / cites work @@
+Choiceless Computation and Symmetry
@@ Property / cites work: Choiceless Computation and Symmetry / rank @@
+Normal rank