{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T01:22:19Z","timestamp":1648862539347},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6407,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1016\/0304-3975(95)00128-x","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"41-56","source":"Crossref","is-referenced-by-count":0,"title":["A theory of even functional and their algorithmic applications"],"prefix":"10.1016","volume":"154","author":[{"given":"Jerzy W.","family":"Jaromczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"\u015awia\u0327tek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00128-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(95)00128-X_BIB2","series-title":"Compilers: Principles, Techniques, and Tools","author":"Aho","year":"1985"},{"key":"10.1016\/0304-3975(95)00128-X_BIB3","series-title":"Proc. 19th Annual ACM Symp. on Theory of Computing","first-page":"1","article-title":"Matrix multiplications via arithmetic progressions","author":"Coppersmith","year":"1987"},{"key":"10.1016\/0304-3975(95)00128-X_BIB4","series-title":"Scientific Computing: An Introduction with Parallel Computing","author":"Golub","year":"1993"},{"key":"10.1016\/0304-3975(95)00128-X_BIB5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0167-5060(08)70343-1","article-title":"Methods of nonlinear 0\u20131 programming","volume":"5","author":"Hansen","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0304-3975(95)00128-X_BIB6","series-title":"Graphical Enumeration","author":"Harary","year":"1973"},{"key":"10.1016\/0304-3975(95)00128-X_BIB7","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0304-3975(95)00128-X_BIB8","series-title":"SODA '93","first-page":"138","article-title":"On the number of Eulerian orientations of a graph","author":"Mihail","year":"1993"},{"key":"10.1016\/0304-3975(95)00128-X_BIB9","first-page":"239","article-title":"How to find longest paths efficiently","volume":"25","author":"Monien","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0304-3975(95)00128-X_BIB10","series-title":"16th Internat. Workshop WG'90","first-page":"18","volume":"Vol. 484","author":"Plehn","year":"1990"},{"key":"10.1016\/0304-3975(95)00128-X_BIB11","first-page":"249","article-title":"Finding cycles of a given length","volume":"27","author":"Richards","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0304-3975(95)00128-X_BIB12","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/0304-3975(95)00128-X_BIB13","author":"Spencer","year":"1987"},{"key":"10.1016\/0304-3975(95)00128-X_BIB14","first-page":"633","article-title":"Algebraic complexity theory","author":"Strassen","year":"1990"},{"key":"10.1016\/0304-3975(95)00128-X_BIB15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00128-X_BIB16","series-title":"Modern Algebra","author":"van der Waerden","year":"1950"},{"key":"10.1016\/0304-3975(95)00128-X_BIB17","first-page":"526","article-title":"Graph algorithm","author":"van Leeuwen","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500128X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500128X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:52:16Z","timestamp":1555419136000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500128X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["030439759500128X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00128-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}