[mmaroti]

You can use the tensor formalism to express combinatorial problems, but these will not be smooth, so gradient descent algorithms will not work. However, you can turn such boolean tensor problems into huge SAT problems and solve them with SAT solvers. See for example here: https://github.com/mmaroti/uasat