{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T20:19:05Z","timestamp":1785356345852,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540078050","type":"print"},{"value":"9783540382126","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1976]]},"DOI":"10.1007\/3-540-07805-3_5","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:11:00Z","timestamp":1330168260000},"page":"49-71","source":"Crossref","is-referenced-by-count":10,"title":["IV. Weitere zum Erf\u00fcllungsproblem polynomial \u00e4quivalente kombinatorische Aufgaben"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Gathen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Malte","family":"Sieveking","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"5_CR1","first-page":"565","volume":"103","author":"E. H. Bareiss","year":"1968","unstructured":"Bareiss, E.H., Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination, Math. Comp. 22, 103 (1968) 565\u2013578.","journal-title":"Math. Comp. 22"},{"issue":"4","key":"5_CR2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"Edmonds, J., Systems of Distinct Representatives and Linear Algebra, Journal of Research of the National Bureau of Standards, 71B, 4 (1967) 241\u2013245.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"5_CR3","unstructured":"von zur Gathen, J. und Sieveking, M., A Bound on Solutions of Linear Integer Programs, zur Ver\u00f6ffentlichung singereicht."},{"key":"5_CR4","volume-title":"Reducibility among Combinatorial Problems, Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"Karp, R.M., Reducibility among Combinatorial Problems, Complexity of Computer Computations, Plenum Press, New York, 1972."},{"issue":"128","key":"5_CR5","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1090\/S0025-5718-1974-0354624-3","volume":"28","author":"M. Mignotte","year":"1974","unstructured":"Mignotte, M., An Inequality about Factors of Polynomials, Math. Comp. 28, 128 (1974) 1153\u20131157.","journal-title":"Math. Comp."},{"key":"5_CR6","unstructured":"Pratt, V.R., Every Prime has a Succinct Certificate, erscheint demn\u00e4chst."},{"key":"5_CR7","volume-title":"Lineare Ungleichungen","author":"S. N. Tschernikow","year":"1971","unstructured":"Tschernikow, S.N., Lineare Ungleichungen, VEB Deutscher Verlag der Wissenschaften, Berlin, 1971."}],"container-title":["Lecture Notes in Computer Science","Komplexit\u00e4t von Entscheidungsproblemen Ein Seminar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07805-3_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:50:02Z","timestamp":1619542202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07805-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"ISBN":["9783540078050","9783540382126"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-07805-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976]]}}}