{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:42:14Z","timestamp":1787496134445,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319135236","type":"print"},{"value":"9783319135243","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13524-3_16","type":"book-chapter","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T12:51:38Z","timestamp":1417524698000},"page":"184-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations"],"prefix":"10.1007","author":[{"given":"Holger","family":"Dell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L.M.: Two theorems on random polynomial time. In: Proceedings of the 19th Annual Symposium on Foundations of Computer Science (FOCS), pp. 75\u201383 (1978)","DOI":"10.1109\/SFCS.1978.37"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"issue":"8","key":"16_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/120880240","volume":"28","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28(1), 277\u2013305 (2014)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s00037-013-0059-7","volume":"22","author":"H Dell","year":"2013","unstructured":"Dell, H., Kabanets, V., van Melkebeek, D., Watanabe, O.: Is Valiant-Vazirani\u2019s isolation probability improvable? Comput. Complex. 22(2), 345\u2013383 (2013)","journal-title":"Comput. Complex."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Dell, H., Marx, D.: Kernelization of packing problems. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 68\u201381 (2012)","DOI":"10.1137\/1.9781611973099.6"},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/2629620","volume":"61","author":"H Dell","year":"2014","unstructured":"Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. J. ACM 61(4), 27 (2014)","journal-title":"J. ACM"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Drucker, A.: New limits to classical and quantum instance compression. In: Proceedings of the 53rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 609\u2013618 (2012)","DOI":"10.1109\/FOCS.2012.71"},{"key":"16_CR9","unstructured":"Drucker, A.: New limits to classical and quantum instance compression. Technical report TR12-112 rev. 2, Electronic Colloquium on Computational Complexity (ECCC) (2013). http:\/\/eccc.hpi-web.de\/report\/2012\/112\/"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","volume":"77","author":"L Fortnow","year":"2011","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1), 91\u2013106 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Hermelin, D., Wu, X.: Weak compositions and their applications to polynomial lower bounds for kernelization. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 104\u2013113 (2012)","DOI":"10.1137\/1.9781611973099.9"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(83)90013-2","volume":"26","author":"KI Ko","year":"1983","unstructured":"Ko, K.I.: On self-reducibility and weak P-selectivity. J. Comput. Syst. Sci. 26, 209\u2013211 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Kratsch, S.: Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 114\u2013122 (2012)","DOI":"10.1137\/1.9781611973099.10"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Philip, G., Ray, S.: Point line cover: the easy kernel is essentially tight. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1596\u20131606 (2014)","DOI":"10.1137\/1.9781611973402.116"},{"key":"16_CR15","unstructured":"Xiao, D.: New perspectives on the complexity of computational learning, and other problems in theoretical computer science. Ph.D. thesis, Princeton University (2009). ftp:\/\/ftp.cs.princeton.edu\/techreports\/2009\/866.pdf"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13524-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T08:46:38Z","timestamp":1675241198000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13524-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135236","9783319135243"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13524-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"3 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}