Counting Homomorphisms to Square-Free Graphs, Modulo 2 (Q3448822): Difference between revisions

← Older edit

@@ description / en / description / en @@
+scientific article; zbMATH DE number 7140810
@@ Property / zbMATH Open document ID @@
+.68241
@@ Property / zbMATH Open document ID: 1427.68241 / rank @@
+Normal rank
@@ Property / DOI @@
+.1145/2898441
@@ Property / DOI: 10.1145/2898441 / rank @@
+Normal rank
@@ Property / published in @@
+ACM Transactions on Computation Theory
@@ Property / published in: ACM Transactions on Computation Theory / rank @@
+Normal rank
@@ Property / publication date @@
+December 2019Timestamp +2019-12-06T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2019-12-06T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 6 December 2019 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7140810
@@ Property / zbMATH DE Number: 7140810 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1936195772
@@ Property / OpenAlex ID: W1936195772 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph homomorphism
@@ Property / zbMATH Keywords: graph homomorphism / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+counting modulo 2
@@ Property / zbMATH Keywords: counting modulo 2 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parity complexity dichotomy
@@ Property / zbMATH Keywords: parity complexity dichotomy / rank @@
+Normal rank