{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T10:12:13Z","timestamp":1722939133123},"publisher-location":"New York, New York, USA","reference-count":0,"publisher":"ACM Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1145\/800076.802469","type":"proceedings-article","created":{"date-parts":[[2003,11,25]],"date-time":"2003-11-25T16:40:52Z","timestamp":1069778452000},"page":"158-167","source":"Crossref","is-referenced-by-count":10,"title":["Space-bounded probabilistic turing machine complexity classes are closed under complement (Preliminary Version)"],"prefix":"10.1145","author":[{"given":"Janos","family":"Simon","sequence":"first","affiliation":[]}],"member":"320","event":{"number":"13","sponsor":["SIGACT, ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '81","name":"the thirteenth annual ACM symposium","start":{"date-parts":[[1981,5,11]]},"location":"Milwaukee, Wisconsin, United States","end":{"date-parts":[[1981,5,13]]}},"container-title":["Proceedings of the thirteenth annual ACM symposium on Theory of computing - STOC '81"],"original-title":[],"link":[{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=802469&ftid=54044&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,16]],"date-time":"2016-12-16T04:02:43Z","timestamp":1481860963000},"score":1,"resource":{"primary":{"URL":"http:\/\/portal.acm.org\/citation.cfm?doid=800076.802469"}},"subtitle":[],"proceedings-subject":"Theory of computing","short-title":[],"issued":{"date-parts":[[1981]]},"references-count":0,"URL":"http:\/\/dx.doi.org\/10.1145\/800076.802469","relation":{},"subject":[],"published":{"date-parts":[[1981]]}}}
