Revisiting alphabet reduction in Dinur's PCP (2020)
Attributed to:
The Complexity of Promise Constraint Satisfaction
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.4230/lipics.approx/random.2020.34
Publication URI: http://dx.doi.org/10.4230/lipics.approx/random.2020.34
Type: Other
Volume: 176
Parent Publication: Leibniz International Proceedings in Informatics, LIPIcs
ISSN: 18688969