{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T07:19:00Z","timestamp":1649056740569},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1997,12]]},"abstract":"<jats:p> A computational problem is said to have the Ptime self-witnessing property if we can design a Turing machine code M such that if the problem is polynomial-time computable, then M actually encodes a polynomial-time algorithm for it. This notion captures constructivizing proofs of membership in P. In this paper we define and study analogous notions of self-witnessing corresponding to other complexity classes like DLOG, PSPACE, and NC. In particular, we show that logspace self-reducible sets are DLOG self-witnessing and wdq-self-reducible sets are PSPACE self-witnessing. As a consequence of this we derive that for any complexity class [Formula: see text], if [Formula: see text] then [Formula: see text] is constructively equal to DLOG. Likewise, we show that is PSPACE = EXP then PSPACE is constructively equal to EXP. We also show connections between the self-witnessing property and self-helping and program checking <\/jats:p>","DOI":"10.1142\/s0129054197000276","type":"journal-article","created":{"date-parts":[[2003,10,15]],"date-time":"2003-10-15T20:35:19Z","timestamp":1066250119000},"page":"433-442","source":"Crossref","is-referenced-by-count":1,"title":["Constructivizing Membership Proofs in Complexity Classes"],"prefix":"10.1142","volume":"08","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[{"name":"Institute of Mathematical Science, C. I. T Campus, Taramani, Chennai 600 113, India"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054197000276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:45:54Z","timestamp":1565124354000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054197000276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":0,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1997,12]]}},"alternative-id":["10.1142\/S0129054197000276"],"URL":"https:\/\/doi.org\/10.1142\/s0129054197000276","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}