{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T18:31:21Z","timestamp":1675276281263},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0020-0190(96)00096-8","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"211-215","source":"Crossref","is-referenced-by-count":16,"title":["Succinct circuit representations and leaf language classes are basically the same concept"],"prefix":"10.1016","volume":"59","author":[{"given":"Bernd","family":"Borchert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoni","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00096-8_BIB1","series-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0020-0190(96)00096-8_BIB2","series-title":"Computer Science","first-page":"351","article-title":"The complexity of algorithmic problems on succinct instances","author":"Balc\u00e1zar","year":"1992"},{"key":"10.1016\/0020-0190(96)00096-8_BIB3","series-title":"Proc. 9th Structure in Complexity Theory Conf.","first-page":"235","article-title":"Predicate classes and promise classes","author":"Borchert","year":"1994"},{"key":"10.1016\/0020-0190(96)00096-8_BIB4","series-title":"Proc. 6th Structure in Complexity Theory Conf.","first-page":"102","article-title":"Complexity classes and sparse oracles","author":"Bovet","year":"1991"},{"key":"10.1016\/0020-0190(96)00096-8_BIB5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(92)90125-Y","article-title":"A uniform approach to define complexity classes","volume":"104","author":"Bovet","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00096-8_BIB6","series-title":"Proc. 3rd Ann. ACM Symp. on the Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0020-0190(96)00096-8_BIB7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","article-title":"Succinct representations of graphs","volume":"56","author":"Galperin","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(96)00096-8_BIB8","series-title":"Proc. 8th Structure in Complexity Theory Conf.","first-page":"200","article-title":"On the power of polynomial time bit-computations","author":"Hertrampf","year":"1993"},{"key":"10.1016\/0020-0190(96)00096-8_BIB9","series-title":"Proc. 9th Structure in Complexity Theory Conf.","first-page":"242","article-title":"Logspace and logtime leaf languages","author":"Jenner","year":"1994"},{"key":"10.1016\/0020-0190(96)00096-8_BIB10","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(96)00096-8_BIB11","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is log space complete for P","volume":"7","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/0020-0190(96)00096-8_BIB12","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1145\/321724.321731","article-title":"Computational work and time of finite machines","volume":"19","author":"Savage","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(96)00096-8_BIB13","series-title":"Proc. 11th Ann. IEEE Conf. on Computational Complexity","first-page":"118","article-title":"Succinct representation, leaf languages, and projection reductions","author":"Veith","year":"1996"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000968?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000968?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:24:21Z","timestamp":1556058261000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0020019096000968"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00096-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}