{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T04:02:36Z","timestamp":1743912156335,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_15","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T22:21:08Z","timestamp":1342822868000},"page":"170-181","source":"Crossref","is-referenced-by-count":2,"title":["On the NP-Hardness of Max-Not-2"],"prefix":"10.1007","author":[{"given":"Johan","family":"H\u00e5stad","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and intractability of approximation problems. Journal of the ACM\u00a045, 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/100783534","volume":"40","author":"P. Austrin","year":"2011","unstructured":"Austrin, P., H\u00e5stad, J.: Randomly supported independence and resistance. SIAM Journal on Computing\u00a040, 1\u201327 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Austrin, P., H\u00e5stad, J.: On the usefulness of predicates. To appear at the Conference for Computational Complexity, 2012 (2012)","DOI":"10.1109\/CCC.2012.18"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM\u00a042, 1115\u20131145 (1995)","journal-title":"Journal of the ACM"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n 1\u2009\u2212\u2009\u03b5 . Acta Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. JACM\u00a048, 798\u2013859 (2001)","journal-title":"JACM"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-22935-0_21","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"J. H\u00e5stad","year":"2011","unstructured":"H\u00e5stad, J.: Satisfying Degree-d Equations over GF[2] n . In: Goldberg, L.A., et al. (eds.) RANDOM 2011 and APPROX 2011. LNCS, vol.\u00a06845, pp. 242\u2013253. Springer, Heidelberg (2011)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Huang, S.: Approximation resistance on satisfiable instances for predicates strictly dominating parity. ECCC Report 12-040 (2012)","DOI":"10.1145\/2488608.2488666"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of 34th ACM Symposium on Theory of Computating, pp. 767\u2013775 (2002)","DOI":"10.1145\/510014.510017"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Khot, S., Saket, R.: A 3-query non-adaptive pcp with perfect completeness. In: Proc. of 21st Annual Conference on Computational, pp. 159\u2013169. IEEE Computer Society (2006)","DOI":"10.1109\/CCC.2006.5"},{"key":"15_CR11","unstructured":"Khot, S.: Hardness results for coloring 3-colorable 3-uniform hypergraphs. In: Proceedings of 43rd Annual IEEE Symposium of Foundations of Computer Science, pp. 23\u201332 (2002)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1007\/s00039-010-0047-x","volume":"19","author":"E. Mossel","year":"2010","unstructured":"Mossel, E.: Gaussian bounds for noise correlation of functions. GAFA\u00a019, 1713\u20131756 (2010)","journal-title":"GAFA"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Wu, Y.: Conditional hardness for satisfiable 3-CSPs. In: Proceedings of 41st ACM Symposium on Theory of Computating, pp. 493\u2013502 (2009)","DOI":"10.1145\/1536414.1536482"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"Raz, R.: A parallel repetition theorem. SIAM J. on Computing\u00a027, 763\u2013803 (1998)","journal-title":"SIAM J. on Computing"},{"key":"15_CR15","series-title":"LNCS","first-page":"325","volume-title":"APPROX\/RANDOM 2012","author":"C. Wenner","year":"2012","unstructured":"Wenner, C.: Circumventing D-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four. In: Gupta, A., et al. (eds.) APPROX\/RANDOM 2012. LNCS, vol.\u00a07408, pp. 325\u2013337. Springer, Heidelberg (2012)"},{"key":"15_CR16","unstructured":"Zwick, U.: Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In: Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 201\u2013210. ACM (1998)"}],"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_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T03:25:41Z","timestamp":1743823541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}