Comments and questions to:
eptcs@eptcs.org
|
|
For website issues:
webmaster@eptcs.org
|
|
Antonin Delpeuch (University of Oxford) |
Jamie Vicary (University of Cambridge) |
| We show that the word problem for braided monoidal categories is at least as hard as the unknotting problem. As a corollary, so is the word problem for Gray categories. We conjecture that the word problem for Gray categories is decidable. |
| ArXived at: https://dx.doi.org/10.4204/EPTCS.372.6 | bibtex | |
|
Comments and questions to:
eptcs@eptcs.org
|
|
For website issues:
webmaster@eptcs.org
|