{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:16:05Z","timestamp":1787498165236,"version":"build-2736575974"},"reference-count":23,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2003.1214418","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"171-178","source":"Crossref","is-referenced-by-count":6,"title":["Quantum certificate complexity"],"prefix":"10.1109","author":[{"given":"S.","family":"Aaronson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702407345"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060108"},{"key":"23","author":"de wolf","year":"2001","journal-title":"Quantum Computing and Communication Complexity"},{"key":"18","article-title":"Quantum lower bounds for the collision and the element distinctness problems","author":"shi","year":"2002","journal-title":"Proc IEEE FOCS'2002"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1654"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1494"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263419"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"12","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1137\/0220062","article-title":"CREW PRAMs and decision trees","volume":"20","author":"nisan","year":"1991","journal-title":"SIAM J Comput"},{"key":"21","first-page":"417","article-title":"A note on the relations between critical and sensitive complexity","volume":"25","author":"wegener","year":"1989","journal-title":"J Inform Process Cybern"},{"key":"3","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1006\/jcss.2002.1826","article-title":"Quantum lower bounds by quantum arguments","volume":"64","author":"ambainis","year":"2002","journal-title":"J Comput Sys Sci"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892141"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00079-4"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509999"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00144-X"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/261342.261346"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743485"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814607"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90083-6"}],"event":{"name":"18th IEEE Annual Conference on Computational Complexity","location":"Aarhus, Denmark","acronym":"CCC-03"},"container-title":["18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8614\/27296\/01214418.pdf?arnumber=1214418","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:26:13Z","timestamp":1497572773000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214418\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/ccc.2003.1214418","relation":{},"subject":[]}}