{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T08:47:07Z","timestamp":1672476427349},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Logic and Computation"],"published-print":{"date-parts":[[2005,2,1]]},"DOI":"10.1093\/logcom\/exh036","type":"journal-article","created":{"date-parts":[[2005,2,2]],"date-time":"2005-02-02T18:20:07Z","timestamp":1107368407000},"page":"41-58","source":"Crossref","is-referenced-by-count":5,"title":["Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time"],"prefix":"10.1093","volume":"15","author":[{"given":"O.","family":"Bournez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/15\/1\/41\/2791270\/exh036.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T17:10:04Z","timestamp":1503508204000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/exh036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2,1]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2,1]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exh036","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2,1]]}}}