Cenny Wenner. Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four. Electronic Colloquium on Computational Complexity (ECCC), 19:145, 2012. [doi]
@article{Wenner12,
title = {Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four},
author = {Cenny Wenner},
year = {2012},
url = {http://eccc.hpi-web.de/report/2012/145},
researchr = {https://researchr.org/publication/Wenner12},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {19},
pages = {145},
}