{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:49:52Z","timestamp":1730202592496,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2004.1313820","type":"proceedings-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T00:14:14Z","timestamp":1100304854000},"page":"130-138","source":"Crossref","is-referenced-by-count":2,"title":["Separating complexity classes using structural properties"],"prefix":"10.1109","author":[{"given":"H.","family":"Buhrman","sequence":"first","affiliation":[]},{"given":"L.","family":"Torenvliet","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Polynomial Reducibilities and Complete Sets","year":"1977","author":"berman","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09510-1_44"},{"key":"1","first-page":"1","article-title":"Circuit complexity before the dawn of the new nrilleniam","volume":"1180","author":"allender","year":"1996","journal-title":"Proceedings 16th Foundations of Software Technology and Theoretical Computer Science Volume 1180 of Lecture Notes in Computer Science"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04880-1"},{"key":"6","first-page":"143","article-title":"Tt and m-degrees","volume":"12","author":"degtev","year":"1973","journal-title":"Alg Log"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798334736"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795279724"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1944-08111-1"},{"key":"8","first-page":"220","article-title":"P=BPP unless E has subexponential circuits","author":"impagliazzo","year":"1997","journal-title":"Proc The 19th Annual ACM Symposium on Theory of Computing"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00061-9"}],"event":{"name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","location":"Amherst, MA, USA"},"container-title":["Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9188\/29139\/01313820.pdf?arnumber=1313820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T04:37:57Z","timestamp":1489466277000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1313820\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/ccc.2004.1313820","relation":{},"subject":[]}}