{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T10:13:30Z","timestamp":1729678410751,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1109\/ccc.2009.21","type":"proceedings-article","created":{"date-parts":[[2009,9,9]],"date-time":"2009-09-09T19:34:43Z","timestamp":1252524883000},"page":"19-26","source":"Crossref","is-referenced-by-count":8,"title":["Fixed-Polynomial Size Circuit Bounds"],"prefix":"10.1109","author":[{"given":"Lance","family":"Fortnow","sequence":"first","affiliation":[]},{"given":"Rahul","family":"Santhanam","sequence":"additional","affiliation":[]},{"given":"Ryan","family":"Williams","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"19","DOI":"10.1016\/S0022-0000(02)00024-7"},{"doi-asserted-by":"publisher","key":"35","DOI":"10.1016\/0304-3975(83)90015-4"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1007\/11672142_18"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1016\/0022-0000(89)90025-1"},{"doi-asserted-by":"publisher","key":"33","DOI":"10.1016\/0304-3975(86)90135-0"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1145\/800152.804913"},{"doi-asserted-by":"publisher","key":"34","DOI":"10.1109\/SFCS.1982.45"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1016\/0020-0190(88)90152-4"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1109\/CCC.2005.27"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1016\/j.jcss.2003.07.015"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1137\/0213053"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1016\/0022-0000(88)90028-1"},{"doi-asserted-by":"publisher","key":"21","DOI":"10.1007\/s00037-004-0182-6"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1016\/S0019-9958(82)90382-5"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1137\/S0097539795296206"},{"doi-asserted-by":"publisher","key":"23","DOI":"10.1145\/146585.146605"},{"doi-asserted-by":"publisher","key":"24","DOI":"10.1109\/SCT.1994.315815"},{"doi-asserted-by":"publisher","key":"25","DOI":"10.1016\/S0022-0000(05)80043-1"},{"doi-asserted-by":"publisher","key":"26","DOI":"10.1006\/jcss.1997.1494"},{"doi-asserted-by":"publisher","key":"27","DOI":"10.1145\/1250790.1250832"},{"doi-asserted-by":"publisher","key":"28","DOI":"10.1145\/322047.322061"},{"doi-asserted-by":"publisher","key":"29","DOI":"10.1145\/146585.146609"},{"key":"3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1490270.1490272","article-title":"algebrization: a new barrier in complexity theory","volume":"1","author":"aaronson","year":"2009","journal-title":"ACM Trans Comput Theory"},{"key":"2","first-page":"279","volume":"137","author":"vikraman","year":"1995","journal-title":"Uwe Schoning and Rainer Schuler"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1016\/0890-5401(91)90075-D"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/CCC.2006.32"},{"doi-asserted-by":"publisher","key":"30","DOI":"10.1137\/0220053"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1007\/BF01200056"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1007\/s00037-001-8190-2"},{"key":"32","first-page":"129","article-title":"a generic time hierarchy for semantic models with one bit of advice","author":"melkebeek","year":"2006","journal-title":"Proceedings of 21st Annual IEEE Conference on Computational Complexity"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1006\/jcss.1996.0021"},{"doi-asserted-by":"publisher","key":"31","DOI":"10.1016\/j.tcs.2005.07.032"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1145\/276698.276737"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/CCC.1998.694585"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1007\/BF01275486"}],"event":{"name":"2009 24th Annual IEEE Conference on Computational Complexity (CCC)","start":{"date-parts":[[2009,7,15]]},"location":"Paris, France","end":{"date-parts":[[2009,7,18]]}},"container-title":["2009 24th Annual IEEE Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5231175\/5231176\/05231192.pdf?arnumber=5231192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T23:34:31Z","timestamp":1497828871000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5231192\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/ccc.2009.21","relation":{},"subject":[],"published":{"date-parts":[[2009,7]]}}}