{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T23:13:19Z","timestamp":1780096399143,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540359043","type":"print"},{"value":"9783540359050","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_21","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"226-237","source":"Crossref","is-referenced-by-count":32,"title":["Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion"],"prefix":"10.1007","author":[{"given":"Subhash","family":"Khot","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashok Kumar","family":"Ponnuswami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Arora, S.: Probabilistic checking of proofs and the hardness of approximation problems. Ph.D. thesis, UC Berkeley (1994)"},{"issue":"3","key":"21_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., Motawani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"issue":"1","key":"21_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 $\\mbox{NP}$ . Journal of the ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"Journal of the ACM"},{"key":"21_CR4","unstructured":"Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability. Electronic Colloquium on Computational Complexity, Technical Report TR95-024 (1995)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Goldwasser, S., Lund, C., Russell, A.: Efficient probabilistic checkable proofs and applications to approximation. In: Proc. 25th ACM Symposium on Theory of Computing, pp. 294\u2013304 (1993)","DOI":"10.1145\/167088.167174"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Sudan, M.: Improved non-approximability results. In: Proc. 26th ACM Symposium on Theory of Computing, pp. 184\u2013193 (1994)","DOI":"10.1145\/195058.195129"},{"key":"21_CR7","unstructured":"Blum, A.L.: Algorithms for approximate graph coloring. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, USA (1992)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Dumer, I., Micciancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. In: Proc. 40th IEEE Symposium on Foundations of Computer Science (1999)","DOI":"10.1109\/SFFCS.1999.814620"},{"key":"21_CR9","unstructured":"Engebretsen, L., Holmerin, J.: Towards optimal lower bounds for clique and chromatic number. Electronic Colloquium on Computational Complexity (ECCC) (TR01-003) (2001)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U.: Randomized graph products, chromatic numbers, and the lov\u00e1sz \u03b8-function. In: Proc. 27th ACM Symposium on Theory of Computing, pp. 635\u2013640 (1995)","DOI":"10.1145\/225058.225281"},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1137\/S089548010240415X","volume":"18","author":"U. Feige","year":"2004","unstructured":"Feige, U.: Approximating maximum clique by removing subgraphs. SIAM J. Discrete Math.\u00a018(2), 219\u2013225 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/226643.226652","volume":"43","author":"U. Feige","year":"1996","unstructured":"Feige, U., Goldwasser, S., Lov\u00e1sz, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. Journal of the ACM\u00a043(2), 268\u2013292 (1996)","journal-title":"Journal of the ACM"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J.: Two prover protocols: low error at affordable rates. In: Proc. 26th ACM Symposium on Theory of Computing, pp. 172\u2013183 (1994)","DOI":"10.1145\/195058.195128"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J.: Zero knowledge and the chromatic number. In: Proc. 11thIEEE Conference on Computational Complexity, pp. 278\u2013287 (1996)","DOI":"10.1109\/CCC.1996.507690"},{"key":"21_CR15","unstructured":"Feige, U., Kogan, S.: Hardness of approximation of the balanced complete bipartite subgraph problem. Technical Report MCS04-04, The Weizmann Institute of Science (2004)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Hastad, J.: Clique is hard to approximate within n 1\u2009\u2212\u2009\u03b5 . In: Proc. 37th IEEE Symposium on Foundations of Computer Science, pp. 627\u2013636 (1996)","DOI":"10.1109\/SFCS.1996.548522"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Testing of the long code and hardness for clique. In: Proc. 28th ACM Symposium on Theory of Computing, pp. 11\u201319 (1996)","DOI":"10.1145\/237814.237820"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Hastad, J.: Some optimal inapproximability results. In: Proc. 29th ACM Symposium on Theory of Computing, pp. 1\u201310 (1997)","DOI":"10.1145\/258533.258536"},{"key":"21_CR19","unstructured":"Hastad, J., Wigderson, A.: Simple analysis of graph tests for linearity and PCP. In: Proc. 16th IEEE Conference on Computational Complexity (2001)"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Khot, S.: Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: Proc. 42nd IEEE Annual Symposium on Foundations of Computer Science (2001)","DOI":"10.1109\/SFCS.2001.959936"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1145\/509907.510017","volume-title":"STOC 2002: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing","author":"S. Khot","year":"2002","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: STOC 2002: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 767\u2013775. ACM Press, New York (2002)"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Knuth, D.E.: The sandwich theorem. Electr. J. Comb.\u00a01 (1994)","DOI":"10.37236\/1193"},{"issue":"3","key":"21_CR23","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. of Computing\u00a027(3), 763\u2013803 (1998)","journal-title":"SIAM J. of Computing"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Samorodnitsky, A., Trevisan, L.: A PCP characterization of NP with optimal amortized query complexity. In: Proc. 32nd ACM Symposium on Theory of Computing, pp. 191\u2013199 (2000)","DOI":"10.1145\/335305.335329"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Samorodnitsky, A., Trevisan, L.: Gowers uniformity, influence of variables, and pcps. Electronic Colloquium on Computational Complexity (ECCC) (TR05-116) (2005)","DOI":"10.1145\/1132516.1132519"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: The value of strong inapproximability results for clique. In: STOC 2000: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 144\u2013152 (2000)","DOI":"10.1145\/335305.335322"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proc. 33rd ACM Symposium on Theory of Computing, pp. 453\u2013461 (2001)","DOI":"10.1145\/380752.380839"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: On unapproximable versions of NP-complete problems. SIAM J. on Computing, 1293\u20131304 (1996)","DOI":"10.1137\/S0097539794266407"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T16:15:26Z","timestamp":1736439326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11786986_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}