Notes on presheaf representations of strategies and cohomological refinements of $k$-consistency and $k$-equivalence

Roger Godement, Topologie algébrique et théorie des faisceaux , Hermann, 1958

1958

Earlier work this paper cites.

Lionel S. Penrose and Roger Penrose, Impossible objects: A special type of visual illusion , British Journal of Psychology 49

1958

Earlier work this paper cites.

Ravindran Kannan and Achim Bachem, Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix , siam Journal on Computing 8

1979

Earlier work this paper cites.

Jin-Yi Cai, Martin Fürer, and Neil Immerman, An optimal lower bound on the number of variables for graph identification , Combinatorica 12

1992

Earlier work this paper cites.

Roger Penrose, On the cohomology of impossible figures , Leonardo 25

1992

Earlier work this paper cites.

Lauri Hella, Logical hierarchies in PTIME , Information and Computation 121

1996

Earlier work this paper cites.

Tomás Feder and Moshe Y Vardi, The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory , SIAM Journal on Computing 28

1998

Earlier work this paper cites.

Phokion G Kolaitis and Moshe Y Vardi, A game-theoretic approach to constraint satisfaction , AAAI/IAAI, 2000, pp. 175–181

2000

Earlier work this paper cites.

Miklós Maróti and Ralph McKenzie, Existence theorems for weakly symmetric operations , Algebra Universalis 59

2008

Cited alongside, same era.

Samson Abramsky and Adam Brandenburger, The sheaf-theoretic structure of non-locality and contextuality , New Journal of Physics 13

2011

Cited alongside, same era.

Samson Abramsky, Shane Mansfield, and Rui Soares Barbosa, The cohomology of non-locality and contextuality , Proceedings 8th International Workshop on Quantum Physics and Logic, QPL 2011, Nijmegen, Netherlands, October 27-29, 2011 (Bart Jacobs, Peter Selinger, and Bas Spitters, eds.), EPTCS, vol. 95, 2011, pp. 1–14

2011

Cited alongside, same era.

Serge Lang, Algebra , vol. 211, Springer Science & Business Media, 2012

2012

Cited alongside, same era.

Saunders Mac Lane, Categories for the working mathematician , Graduate Texts in Mathematics, vol. 5, Springer, 2013

Andrei A Bulatov, A dichotomy theorem for nonuniform CSPs , 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2017, pp. 319–330

2017

Later among the works it cites.

Giovanni Caru, On the cohomology of contextuality , arXiv preprint arXiv:1701.00656 (2017)

Original

2017

Later among the works it cites.

Sandra Kiefer, The Weisfeiler-Leman algorithm: an exploration of its power , ACM SIGLOG News 7

2020

Later among the works it cites.

Dmitriy Zhuk, A proof of the CSP dichotomy conjecture , Journal of the ACM (JACM) 67

Original

2020

Later among the works it cites.

Anuj Dawar, Erich Grädel, and Moritz Lichter, Limitations of the invertible-map equivalences , arXiv preprint arXiv:2109.07218 (2021)

Original