{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:58:19Z","timestamp":1725469099513},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325113"},{"type":"electronic","value":"9783642325120"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32512-0_28","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T18:21:08Z","timestamp":1342808468000},"page":"325-337","source":"Crossref","is-referenced-by-count":1,"title":["Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four"],"prefix":"10.1007","author":[{"given":"Cenny","family":"Wenner","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Austrin, P., H\u00e5stad, J.: Randomly Supported Independence and Resistance. In: ACM Symp. on the Theory of Comp. (STOC), vol.\u00a041 (2009)","DOI":"10.1145\/1536414.1536481"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Austrin, P., Mossel, E.: Approximation Resistant Predicates from Pairwise Independence. In: IEEE Conf. on Comp. Complexity (CCC), vol.\u00a023 (2008)","DOI":"10.1109\/CCC.2008.20"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-642-03685-9_34","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"V. Chen","year":"2009","unstructured":"Chen, V.: A Hypergraph Dictatorship Test with Perfect Completeness. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol.\u00a05687, pp. 448\u2013461. Springer, Heidelberg (2009)"},{"key":"28_CR4","unstructured":"Chen, V.: Property Testing. Springer (2010)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Feldman, V., Guruswami, V., Raghavendra, P., Yi, W.: Agnostic Learning of Monomials by Halfspaces is Hard. In: (FOCS) IEEE Found. of Comp. Sc., vol.\u00a050 (2009)","DOI":"10.1109\/FOCS.2009.26"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Raghavendra, P., Saket, R.: Bypassing UGC from Some Optimal Geometric Inapproximability Results. In: ACM-SIAM Symp. on Discrete Alg. (SODA), vol.\u00a023 (2012)","DOI":"10.1137\/1.9781611973099.58"},{"key":"28_CR7","unstructured":"H\u00e5stad, J.: On Linear Equations and Satisfiability (2011) (unpublished material)"},{"key":"28_CR8","series-title":"LNCS","first-page":"170","volume-title":"APPROX\/RANDOM 2012","author":"J. H\u00e5stad","year":"2012","unstructured":"H\u00e5stad, J.: On the NP-Hardness of Max-Not-2. In: Gupta, A., et al. (eds.) APPROX\/RANDOM 2012. LNCS, vol.\u00a07408, pp. 170\u2013181. Springer, Heidelberg (2012)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Some Optimal Inapproximability Results. J. of ACM\u00a048 (2001)","DOI":"10.1145\/502090.502098"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Huang, S.: Approximation Resistance on Satisfiable Instances for Predicates Strictly Dominating Parity. Elect. C. on Comp. Complexity (ECCC) (2012)","DOI":"10.1145\/2488608.2488666"},{"key":"28_CR11","unstructured":"Khot, S.: Hardness Results for Coloring 3-Colorable 3-Uniform Hypergraphs. In: IEEE Foundations of Comp. Sc. (FOCS), vol.\u00a043 (2002)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the Power of Unique 2-Prover 1-Round Games. In: ACM Symp. on the Theory of Comp. (STOC), vol.\u00a034 (2002)","DOI":"10.1145\/510014.510017"},{"key":"28_CR13","unstructured":"Khot, S., Saket, R.: A 3-query Non-Adaptive PCP with Perfect Completeness. In: Conf. on Comp. Complexity (CCC), vol.\u00a021 (2006)"},{"key":"28_CR14","volume-title":"Geometric and Functional Analysis","author":"E. Mossel","year":"2010","unstructured":"Mossel, E.: Gaussian Bounds for Noise Correlation of Functions. In: Geometric and Functional Analysis. Birkhauser, Basel (2010)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Mossel, E.: Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes. In: IEEE Found. of Comp. Sc. (FOCS), vol.\u00a049 (2008)","DOI":"10.1109\/FOCS.2008.44"},{"key":"28_CR16","unstructured":"Mossel, E., O\u2019Donnell, R., Oleszkiewicz, K.: Noise stability of Functions with Low Influences: Invariance and Optimality. In: IEEE Foundations of Comp. Sc. (FOCS), vol.\u00a046 (2005)"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Wright, J.: A New Point of NP-hardness for Unique Games. In: ACM Symp. on the Theory of Comp. (STOC), vol.\u00a044 (2012)","DOI":"10.1145\/2213977.2214005"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Yi, W.: 3-Bit Dictator Testing: 1 vs. 5\/8. In: ACM-SIAM Symp. on Discrete Alg. (SODA), vol.\u00a020 (2009)","DOI":"10.1137\/1.9781611973068.41"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Wu, Y.: Conditional Hardness for Satisfiable 3-CSPs. In: ACM Symp. on the Theory of Comp. (STOC), vol.\u00a041 (2009)","DOI":"10.1145\/1536414.1536482"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-15369-3_55","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S. Tamaki","year":"2010","unstructured":"Tamaki, S., Yoshida, Y.: A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010, LNCS, vol.\u00a06302, pp. 738\u2013751. Springer, Heidelberg (2010)"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1007\/978-3-642-10631-6_93","volume-title":"Algorithms and Computation","author":"L. Tang","year":"2009","unstructured":"Tang, L.: Conditional Hardness of Approximating Satisfiable Max 3CSP-q. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 923\u2013932. Springer, Heidelberg (2009)"},{"key":"28_CR22","unstructured":"Wenner, C.: Noise Introduction and Multivariate Invariance for Projection Games (2012) (unpublished manuscript)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32512-0_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:05:29Z","timestamp":1620115529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}