Definable Inapproximability: New Challenges for Duplicator (2018)
Attributed to:
The Alan Turing Institute
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1806.11307
Publication URI: https://arxiv.org/abs/1806.11307
Type: Preprint