乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:19:57Z","timestamp":1725826797325},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480564"},{"type":"electronic","value":"9783662480571"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48057-1_19","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T01:29:54Z","timestamp":1439170194000},"page":"243-255","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Strong Inapproximability of the Shortest Reset Word"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"first","affiliation":[]},{"given":"Damian","family":"Straszak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.09.006","volume":"330","author":"DS Ananichev","year":"2005","unstructured":"Ananichev, D.S., Volkov, M.V.: Synchronizing generalized monotonic automata. Theor. Comput. Sci. 330(1), 3\u201313 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, Cambridge (2009)","edition":"1"},{"issue":"3","key":"19_CR3","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 45(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"19_CR4","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 45(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539796302531","volume":"27","author":"M Bellare","year":"1998","unstructured":"Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs, and nonapproximability\u2013towards tight results. SIAM J. Comput. 27, 804\u2013915 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00224-013-9511-y","volume":"54","author":"MV Berlinkov","year":"2014","unstructured":"Berlinkov, M.V.: Approximating the minimum length of synchronizing words is hard. Theor. Comp. Sys. 54(2), 211\u2013223 (2014)","journal-title":"Theor. Comp. Sys."},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-319-09698-8_6","volume-title":"Developments in Language Theory","author":"MV Berlinkov","year":"2014","unstructured":"Berlinkov, M.V.: On two algorithmic problems about synchronizing automata. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 61\u201367. Springer, Heidelberg (2014)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0219033","volume":"19","author":"D Eppstein","year":"1990","unstructured":"Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput. 19, 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of $$\\ln n$$ for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-18098-9_17","volume-title":"Implementation and Application of Automata","author":"M Gerbush","year":"2011","unstructured":"Gerbush, M., Heeringa, B.: Approximating minimum reset sequences. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 154\u2013162. Springer, Heidelberg (2011)"},{"issue":"3","key":"19_CR11","first-page":"61","volume":"15","author":"M Grech","year":"2013","unstructured":"Grech, M., Kisielewicz, A.: The \u010cern\u00fd conjecture for automata respecting intervals of a directed graph. Discrete Mathematics & Theoretical Computer Science 15(3), 61\u201372 (2013)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"key":"19_CR12","unstructured":"Hastad, J.: Clique is hard to approximate within $$n^{1-\\epsilon }$$. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS 1996, pp. 627\u2013636 (1996)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Hastad, J., Khot, S.: Query efficient PCPs with perfect completeness. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 610\u2013619, October 2001","DOI":"10.1109\/SFCS.2001.959937"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(02)00405-X","volume":"295","author":"J Kari","year":"2003","unstructured":"Kari, J.: Synchronizing finite automata on Eulerian digraphs. Theor. Comput. Sci. 295, 223\u2013232 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-642-15155-2_50","volume-title":"Mathematical Foundations of Computer Science 2010","author":"J Olschewski","year":"2010","unstructured":"Olschewski, J., Ummels, M.: The complexity of finding reset words in finite automata. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 568\u2013579. Springer, Heidelberg (2010)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Pin, J.: On two combinatorial problems arising from automata theory. In: Combinatorial Mathematics Proceedings of the International Colloquium on Graph Theory and Combinatorics, vol. 75, pp. 535\u2013548. North-Holland (1983)","DOI":"10.1016\/S0304-0208(08)73432-7"},{"issue":"1\u20132","key":"19_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(96)00136-3","volume":"172","author":"I Rystsov","year":"1997","unstructured":"Rystsov, I.: Reset words for commutative and solvable automata. Theor. Comput. Sci. 172(1\u20132), 273\u2013279 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"39","key":"19_CR18","doi-asserted-by":"publisher","first-page":"5487","DOI":"10.1016\/j.tcs.2011.06.012","volume":"412","author":"B Steinberg","year":"2011","unstructured":"Steinberg, B.: The \u010cern\u00fd conjecture for one-cluster automata with prime length cycle. Theor. Comput. Sci. 412(39), 5487\u20135491 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"MV Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing automata and the \u010cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11\u201327. Springer, Heidelberg (2008)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48057-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:29:19Z","timestamp":1676471359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48057-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480564","9783662480571"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48057-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}