{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T09:25:59Z","timestamp":1661592359333},"reference-count":17,"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":[[2005,8]]},"abstract":"<jats:p> It is well-known that the \u03a3<jats:sub>k<\/jats:sub>- and \u03a0<jats:sub>k<\/jats:sub>-levels of the dot-depth hierarchy and the polynomial hierarchy correspond via leaf languages. We extend this correspondence to the \u0394<jats:sub>k<\/jats:sub>-levels of these hierarchies: [Formula: see text]. The same methods are used to give evidence against an earlier conjecture of Straubing and Th\u00e9rien about a leaf-language upper bound for BPP. <\/jats:p>","DOI":"10.1142\/s0129054105003200","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T10:52:13Z","timestamp":1120560733000},"page":"625-644","source":"Crossref","is-referenced-by-count":4,"title":["THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS"],"prefix":"10.1142","volume":"16","author":[{"given":"BERND","family":"BORCHERT","sequence":"first","affiliation":[{"name":"Universit\u00e4t T\u00fcbingen, Germany"}]},{"given":"KLAUS-J\u00d6RN","family":"LANGE","sequence":"additional","affiliation":[{"name":"Universit\u00e4t T\u00fcbingen, Germany"}]},{"given":"FRANK","family":"STEPHAN","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"PASCAL","family":"TESSON","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Laval, Qu\u00e9bec, Canada"}]},{"given":"DENIS","family":"TH\u00c9RIEN","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, Canada"}]}],"member":"219","published-online":{"date-parts":[[2012,1,25]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1051\/ita:1999116"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00111-7"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90125-Y"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799360148"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054198000180"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744434"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1137\/0217080"},{"key":"rf12","volume-title":"Computational Complexity","author":"Papadimitriou C.","year":"1990"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_10"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(88)90097-7"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02679467"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02194921"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0289-9"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-002-1035-9"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1142\/9789812776884_0021"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1137\/0219058"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054105003200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:38:31Z","timestamp":1565123911000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054105003200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8]]},"references-count":17,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,8]]}},"alternative-id":["10.1142\/S0129054105003200"],"URL":"https:\/\/doi.org\/10.1142\/s0129054105003200","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,8]]}}}