{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:43Z","timestamp":1725663163915},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_81","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:59:44Z","timestamp":1330189184000},"page":"324-337","source":"Crossref","is-referenced-by-count":15,"title":["The complexity of semilinear sets"],"prefix":"10.1007","author":[{"given":"Thiet-Dung","family":"Huynh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"28_CR1","unstructured":"E.Cardoza, R.Lipton and A.R.Meyer: \"Exponential Space Complete Problem for Petri Nets and Commutative Semigroups\", in \"Proc. of the 8-th Annual ACM Symposium on the Theory of Computing\" (1976), pp. 50\u201354."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"S.Eilenberg and M.P.Sch\u00fctzenberger: \"Rational Sets in Commutative Monoids\", Journal of Algebra, No 13, 1969, pp. 173\u2013191.","DOI":"10.1016\/0021-8693(69)90070-2"},{"issue":"1","key":"28_CR3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/S0002-9939-1978-0500555-0","volume":"72","author":"J. Gathen Von","year":"1978","unstructured":"J. Von Zur Gathen and M. Sieveking: \"A bound on Solutions of Linear Integer Equalities and Inequalities\", Proc. of the AMS, Vol. 72, No 1, 1978, pp. 155\u2013158.","journal-title":"Proc. of the AMS"},{"key":"28_CR4","unstructured":"M. Gerstenhaber: \"Theory of Convex Polyhedral Cones\", in Proc. of a Conference on \"Activity Analysis of Production and Allocation\", Ed. T.C. Koopmans, John Willey & Sons \u2014 Chapman & Hall, 1951."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"S.Ginsburg: \"The Mathematical Theory of Context-free Languages\", Mc Graw-Hill, 1966.","DOI":"10.1145\/321312.321318"},{"key":"28_CR6","first-page":"1","volume":"16","author":"F. Glover","year":"1972","unstructured":"F. Glover and R.E.D. Woolsey: \"Aggregating Diophantine Equations\", Zeitschrift f\u00fcr Operations Researchs, Vol. 16, 1972, pp. 1\u201310.","journal-title":"Zeitschrift f\u00fcr Operations Researchs"},{"key":"28_CR7","unstructured":"G.Hotz: \"Eine Neue Invariante Kontext-freier Grammatiken\", 1978, to appear in Theoretical Computer Science."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"G.Hotz: \"Verschr\u00e4nkte Homomorphismen Formaler Sprachen\", 1979, to appear in RAIRO.","DOI":"10.1051\/ita\/1980140201931"},{"key":"28_CR9","unstructured":"W.J.Paul: \"Komplexit\u00e4tstheorie\", Teubner Verlag, 1979."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"L.Stockmeyer and A.R.Meyer: \"Word Problem Requiring Exponential Time\", in Proc. of the 5-th Annual Symposium on the Theory of Computing, 1973, pp. 1\u20139.","DOI":"10.1145\/800125.804029"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1977","unstructured":"L. Stockmeyer: \"The Polynomial-Time Hierarchy\", Theoretical Computer Science, Vol. 3, 1977, pp. 1\u201312.","journal-title":"Theoretical Computer Science"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"J.Stoer and C.Witzgall: \"Convexity and Optimization in Finite Dimension I\", Springer Verlag, 1970.","DOI":"10.1007\/978-3-642-46216-0"},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C. Wrathall","year":"1977","unstructured":"C. Wrathall: \"Complete Sets and the Polynomial-Time Hierarchy\", Theoretical Computer Science, Vol. 3, 1977, pp. 23\u201333.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_81.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:22Z","timestamp":1605643342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]}}}