Definable inapproximability: New challenges for duplicator
Accepted version
Peer-reviewed
Repository URI
Repository DOI
Change log
Authors
Abstract
jats:titleAbstract</jats:title>jats:pWe consider the hardness of approximation of optimization problems from the point of view of definability. For many
Description
Keywords
Journal Title
Conference Name
Journal ISSN
1465-363X