{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:49:57Z","timestamp":1730202597388,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2004.1313839","type":"proceedings-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T00:14:14Z","timestamp":1100304854000},"page":"184-197","source":"Crossref","is-referenced-by-count":1,"title":["Properties of NP-complete sets"],"prefix":"10.1109","author":[{"given":"C.","family":"Glasser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Pavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.L.","family":"Selman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Sengupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0061"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90125-D"},{"key":"17","article-title":"Disjoint NP-pairs","author":"gla\ufffder","year":"2003","journal-title":"Proceedings of the 18th IEEE Conference on Computational Complexity"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1007\/BF02090391"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80006-6"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1137\/0217062"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1137\/0217018"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.2307\/2272046"},{"key":"16","article-title":"Reductions between disjoint NP-pairs","author":"gla\ufffder","year":"2004","journal-title":"Proceedings of the 19th IEEE Conference on Computational Complexity"},{"key":"13","first-page":"25","article-title":"A hardcore predicate for all one-way functions","author":"goldreich","year":"1989","journal-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.45"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s002240011003"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1137\/0212027"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202282"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90023-C"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050109"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1026"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90139-9"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90002-2"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90139-2"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80043-1"},{"journal-title":"On P-closeness of Polynomial-time Hard Sets","year":"1991","author":"ogiwara","key":"27"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1137\/0220030"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701387039"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1976.22"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185343"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1996.507683"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2002.1004349"},{"key":"30","article-title":"On provably disjoint NP-pairs","volume":"tr94 6","author":"razborov","year":"1994","journal-title":"Technical Report"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795279724"},{"key":"6","first-page":"116","article-title":"Snperpolynomial circuits, almost sparse oracles, and the exponential hierarchy","volume":"652","author":"buhrman","year":"1992","journal-title":"Foundations of Software Technology and Theoretical Computer Science 12th Conference New Delhi India December 18-20 1992 Proceedings Volume 652 of Lecture Notes in Computer Science"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09510-1_44"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/0206023"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01704904"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.2307\/2273702"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/0213053"}],"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\/01313839.pdf?arnumber=1313839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T04:32:13Z","timestamp":1489465933000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1313839\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/ccc.2004.1313839","relation":{},"subject":[]}}