📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Constraint Satisfaction, Graph Isomorphism, and the Pebbling Comonad

First Author: Dawar A

Attributed to: Limits of Symmetric Computation funded by Horizon Europe Guarantee

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-031-24117-8_18

Publication URI: http://dx.doi.org/10.1007/978-3-031-24117-8_18

Type: Book Chapter

Book Title: Samson Abramsky on Logic and Structure in Computer Science and Beyond (2023)

Page Reference: 671-699