{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:26:49Z","timestamp":1758274009812},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403279"},{"type":"electronic","value":"9783642403286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40328-6_3","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T09:17:34Z","timestamp":1376644654000},"page":"26-41","source":"Crossref","is-referenced-by-count":1,"title":["On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Per","family":"Austrin","sequence":"first","affiliation":[]},{"given":"Rajsekar","family":"Manokaran","sequence":"additional","affiliation":[]},{"given":"Cenny","family":"Wenner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B., Steurer, D.: Subexponential algorithms for Unique Games and related problems. In: FOCS, pp. 563\u2013572. IEEE Computer Society (2010)","key":"3_CR1","DOI":"10.1109\/FOCS.2010.59"},{"issue":"3","key":"3_CR2","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 the hardness of approximation problems. J. ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. J. ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"issue":"2","key":"3_CR4","first-page":"249","volume":"18","author":"P. Austrin","year":"2009","unstructured":"Austrin, P., Mossel, E.: Approximation resistant predicates from pairwise independence. CCC\u00a018(2), 249\u2013271 (2009)","journal-title":"CCC"},{"doi-asserted-by":"crossref","unstructured":"Barak, B., Brand\u00e3o, F.G.S.L., Harrow, A.W., Kelner, J.A., Steurer, D., Zhou, Y.: Hypercontractivity, sum-of-squares proofs, and their applications. In: Karloff, H.J., Pitassi, T. (eds.) STOC, pp. 307\u2013326. ACM (2012)","key":"3_CR5","DOI":"10.1145\/2213977.2214006"},{"doi-asserted-by":"crossref","unstructured":"Chan, S.O.: Approximation resistance from pairwise independent subgroups. In: STOC, pp. 325\u2013337 (2013)","key":"3_CR6","DOI":"10.1145\/2488608.2488665"},{"doi-asserted-by":"crossref","unstructured":"Charikar, M., Guruswami, V., Manokaran, R.: Every permutation CSP of arity 3 is approximation resistant. In: CCC, pp. 62\u201373 (2009)","key":"3_CR7","DOI":"10.1109\/CCC.2009.29"},{"doi-asserted-by":"crossref","unstructured":"Charikar, M., Makarychev, K., Makarychev, Y.: On the advantage over random for Maximum Acyclic Subgraph. In: FOCS, pp. 625\u2013633. IEEE Computer Society (2007)","key":"3_CR8","DOI":"10.1109\/FOCS.2007.4389531"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/S0895480195296221","volume":"11","author":"B. Chor","year":"1998","unstructured":"Chor, B., Sudan, M.: A geometric approach to betweenness. SIAM J. Disc. Math.\u00a011(4), 511\u2013523 (1998)","journal-title":"SIAM J. Disc. Math."},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/rsa.20226","volume":"33","author":"L. Engebretsen","year":"2008","unstructured":"Engebretsen, L., Holmerin, J.: More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. Rand. Struct. Algo.\u00a033(4), 497\u2013514 (2008)","journal-title":"Rand. Struct. Algo."},{"key":"3_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1137\/090756144","volume":"40","author":"V. Guruswami","year":"2011","unstructured":"Guruswami, V., H\u00e5stad, J., Manokaran, R., Raghavendra, P., Charikar, M.: Beating the random ordering is hard: Every ordering CSP is approximation resistant. SIAM J. Comput.\u00a040(3), 878\u2013914 (2011)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Guruswami, V., Manokaran, R., Raghavendra, P.: Beating the random ordering is hard: Inapproximability of Maximum Acyclic Subgraph. In: FOCS, pp. 573\u2013582 (2008)","key":"3_CR13","DOI":"10.1109\/FOCS.2008.51"},{"doi-asserted-by":"crossref","unstructured":"Guruswami, V., Raghavendra, P., Saket, R., Wu, Y.: Bypassing UGC from some optimal geometric inapproximability results. In: Rabani, Y. (ed.) SODA, pp. 699\u2013717. SIAM (2012)","key":"3_CR14","DOI":"10.1137\/1.9781611973099.58"},{"issue":"4","key":"3_CR15","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. J. ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: STOC, pp. 767\u2013775 (2002)","key":"3_CR16","DOI":"10.1145\/510014.510017"},{"doi-asserted-by":"crossref","unstructured":"Mossel, E.: Gaussian bounds for noise correlation of functions. Geo. and Func. Anal.\u00a019 (2010)","key":"3_CR17","DOI":"10.1007\/s00039-010-0047-x"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-44666-4_18","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"A. Newman","year":"2001","unstructured":"Newman, A.: The Maximum Acyclic Subgraph Problem and degree-3 graphs. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX-RANDOM 2001. LNCS, vol.\u00a02129, pp. 147\u2013158. Springer, Heidelberg (2001)"},{"issue":"3","key":"3_CR19","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. Comput.\u00a027(3), 763\u2013803 (1998)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Samorodnitsky, A., Trevisan, L.: A PCP characterization of NP with optimal amortized query complexity. In: Yao, F.F., Luks, E.M. (eds.) STOC, pp. 191\u2013199. ACM (2000)","key":"3_CR20","DOI":"10.1145\/335305.335329"},{"issue":"6","key":"3_CR21","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1137\/S0097539797328847","volume":"29","author":"L. Trevisan","year":"2000","unstructured":"Trevisan, L., Sorkin, G.B., Sudan, M., Williamson, D.P.: Gadgets, approximation, and linear programming. SIAM J. Comput.\u00a029(6), 2074\u20132097 (2000)","journal-title":"SIAM J. Comput."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-32512-0_28","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C. Wenner","year":"2012","unstructured":"Wenner, C.: Circumventing d-to-1 for approximation resistance of satisfiable predicates strictly containing parity of width four (extended abstract). In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX\/RANDOM 2012 LNCS, vol.\u00a07408, pp. 325\u2013337. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Wolff, P.: Hypercontractivity of simple random variables. Studia Mathematica, 219\u2013326 (2007)","key":"3_CR23","DOI":"10.4064\/sm180-3-3"}],"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-40328-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:52:53Z","timestamp":1558014773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}