%0 Journal Article %1 journals/toc/Wenner13 %A Wenner, Cenny %D 2013 %J Theory of Computing %K dblp %P 703-757 %T Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four. %U http://dblp.uni-trier.de/db/journals/toc/toc9.html#Wenner13 %V 9

@article{journals/toc/Wenner13, added-at = {2019-05-14T00:00:00.000+0200}, author = {Wenner, Cenny}, biburl = {https://www.bibsonomy.org/bibtex/2994430ff693b7ed8f0c74eaa98f1f74e/dblp}, ee = {https://doi.org/10.4086/toc.2013.v009a023}, interhash = {dc341bf9ec286620d07359a4f200d3ec}, intrahash = {994430ff693b7ed8f0c74eaa98f1f74e}, journal = {Theory of Computing}, keywords = {dblp}, pages = {703-757}, timestamp = {2019-05-15T11:38:10.000+0200}, title = {Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four.}, url = {http://dblp.uni-trier.de/db/journals/toc/toc9.html#Wenner13}, volume = 9, year = 2013 }