{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:44Z","timestamp":1725663584335},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569398"},{"type":"electronic","value":"9783540478263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56939-1_67","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:55:04Z","timestamp":1330239304000},"page":"126-136","source":"Crossref","is-referenced-by-count":0,"title":["A theory of even functionals and their algorithmic applications"],"prefix":"10.1007","author":[{"given":"Jerzy W.","family":"Jaromczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"\u015awicatek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"11_CR1","unstructured":"A. V. Aho and J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"D. Coppersmith and S. Winograd, Matrix multiplications via arithmetic progressions, in Proc. 19th Annual Acm Symp. on Theory of Computing, pp. 1\u20136, 1987.","DOI":"10.1145\/28395.28396"},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0167-5060(08)70343-1","volume":"5","author":"P. Hansen","year":"1979","unstructured":"P. Hansen, Methods of nonlinear 0\u20131 programming, Ann. Discrete Math., 5 (1979), pp. 53\u201370.","journal-title":"Ann. Discrete Math."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press (1973)","DOI":"10.1016\/B978-0-12-324245-7.50005-8"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C. D. Gelatt Jr., and M.P. Vecchi, Optimization by Simulated Annealing, Science, 220, 671\u2013680, 1983.","journal-title":"Science"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"J. van Leeuwen, Graph Algorithm, pp.526\u2013631, in \u201cHandbook of Theoretical Computer science\u201d, Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50015-1"},{"key":"11_CR7","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver, Theory of Linear and Integer Programming, John Wiley, New York, 1986."},{"key":"11_CR8","unstructured":"J. Spencer Ten lectures on the probabilistic methods, SIAM, 1987."},{"key":"11_CR9","volume-title":"Modern algebra","author":"B. L. Waerden van der","year":"1950","unstructured":"B. L. van der Waerden, Modern algebra, Frederick Ungar Publishing Co., New York, 1950."}],"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-56939-1_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:07:29Z","timestamp":1605629249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56939-1_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569398","9783540478263"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-56939-1_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}