{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:41:34Z","timestamp":1702028494441},"publisher-location":"Providence, Rhode\n Island","reference-count":0,"publisher":"American Mathematical\n Society","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993,10,25]]},"DOI":"10.1090\/dimacs\/013\/11","type":"book-chapter","created":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T02:32:15Z","timestamp":1493260335000},"page":"183-193","source":"Crossref","is-referenced-by-count":20,"title":["A new lower bound theorem for read only once\n branching programs and its applications"],"prefix":"10.1090","author":[{"given":"Janos","family":"Simon","sequence":"first","affiliation":[]},{"given":"Mario","family":"Szegedy","sequence":"additional","affiliation":[]}],"member":"14","container-title":["DIMACS Series in Discrete Mathematics and\n Theoretical Computer Science","Advances in Computational Complexity\n Theory"],"original-title":[],"deposited":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T02:32:23Z","timestamp":1493260343000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.ams.org\/dimacs\/013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10,25]]},"references-count":0,"URL":"http:\/\/dx.doi.org\/10.1090\/dimacs\/013\/11","relation":{},"ISSN":["1052-1798","2472-4793"],"issn-type":[{"value":"1052-1798","type":"print"},{"value":"2472-4793","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,10,25]]}}}
