{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:25:51Z","timestamp":1740029151730,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_30","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"332-343","source":"Crossref","is-referenced-by-count":2,"title":["On Quadratic Threshold CSPs"],"prefix":"10.1007","author":[{"given":"Per","family":"Austrin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siavosh","family":"Benabbas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avner","family":"Magen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Austrin, P., H\u00e5stad, J.: Randomly Supported Independence and Resistance. In: ACM Symposium on Theory of Computing (STOC), pp. 483\u2013492 (2009)","DOI":"10.1145\/1536414.1536481"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00037-009-0272-6","volume":"18","author":"P. Austrin","year":"2009","unstructured":"Austrin, P., Mossel, E.: Approximation Resistant Predicates from Pairwise Independence. Computational Complexity\u00a018(2), 249\u2013271 (2009)","journal-title":"Computational Complexity"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-31856-9_16","volume-title":"STACS 2005","author":"L. Engebretsen","year":"2005","unstructured":"Engebretsen, L., Holmerin, J.: More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 194\u2013205. Springer, Heidelberg (2005)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-642-03685-9_10","volume-title":"APPROX 2009 RANDOM 2009","author":"K. Georgiou","year":"2009","unstructured":"Georgiou, K., Magen, A., Tulsiani, M.: Optimal sherali-adams gaps from pairwise independence. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009 RANDOM 2009. LNCS, vol.\u00a05687, pp. 125\u2013139. Springer, Heidelberg (2009)"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: 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":"30_CR6","doi-asserted-by":"crossref","unstructured":"Hast, G.: Beating a Random Assignment \u2013 Approximating Constraint Satisfaction Problems. Ph.D. thesis, KTH \u2013 Royal Institute of Technology (2005)","DOI":"10.1007\/11538462_12"},{"issue":"4","key":"30_CR7","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. Journal of the ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"Journal of the ACM"},{"key":"30_CR8","unstructured":"H\u00e5stad, J.: Personal communication (2009)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Karloff, H., Zwick, U.: A 7\/8-Approximation Algorithm for MAX 3SAT? In: IEEE Symposium on Foundations of Computer Science (FOCS), p. 406 (1997)","DOI":"10.1109\/SFCS.1997.646129"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the Power of Unique 2-prover 1-round Games. In: ACM Symposium on Theory of Computing (STOC), pp. 767\u2013775 (2002)","DOI":"10.1145\/510014.510017"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Samorodnitsky, A., Trevisan, L.: A PCP characterization of NP with optimal amortized query complexity. In: ACM Symposium on Theory of Computing (STOC), pp. 191\u2013199 (2000)","DOI":"10.1145\/335305.335329"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Samorodnitsky, A., Trevisan, L.: Gowers Uniformity, Influence of Variables, and PCPs. In: ACM Symposium on Theory of Computing (STOC), pp. 11\u201320 (2006)","DOI":"10.1145\/1132516.1132519"},{"key":"30_CR13","unstructured":"Zwick, U.: Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables Per Constraint. In: ACM-SIAM Symposium on Discrete Algorithms, SODA (1998)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T03:13:07Z","timestamp":1740021187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}