{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:04:58Z","timestamp":1759709098532,"version":"build-2065373602"},"reference-count":36,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00323-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:54:58Z","timestamp":1027634098000},"page":"501-523","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dot operators"],"prefix":"10.1016","volume":"262","author":[{"given":"Bernd","family":"Borchert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00323-6_BIB1","doi-asserted-by":"crossref","unstructured":"L.M. Adleman, K. Manders, Reducibility, randomness, and intractability, ACM Symp. on Theory of Computing, 1977, pp. 151\u2013163.","DOI":"10.1145\/800105.803405"},{"key":"10.1016\/S0304-3975(00)00323-6_BIB2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0020-0190(86)90078-5","article-title":"A note on complete problems forcomplexity classes","volume":"23","author":"Ambos-Spies","year":"1986","journal-title":"Inform. Process. Lett."},{"year":"1988","series-title":"Structural Complexity I","author":"Balcazar","key":"10.1016\/S0304-3975(00)00323-6_BIB3"},{"key":"10.1016\/S0304-3975(00)00323-6_BIB4","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/0304-3975(79)90043-4","article-title":"A second step toward the polynomial hierarchy","volume":"8","author":"Baker","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0020-0190(97)00111-7","article-title":"A characterization of the leaf language classes","volume":"63","author":"Borchert","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(92)90125-Y","article-title":"A uniform approach to define complexity classes","volume":"104","author":"Bovet","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB7","first-page":"105","volume":"vol. 223","author":"Cai","year":"1994"},{"key":"10.1016\/S0304-3975(00)00323-6_BIB8","unstructured":"A. Eisenbl\u00e4tter, \u00dcber einige zentrale Operatoren in der Komplexit\u00e4tstheorie, Diploma Thesis, Universit\u00e4t Heidelberg, 1994."},{"issue":"1","key":"10.1016\/S0304-3975(00)00323-6_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(91)90070-I","article-title":"Strong and robustly strong polynomial time reducibilities to sparse sets","volume":"88","author":"Gavald\u00e0","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(88)90022-9","article-title":"Complexity classes without machines: on complete languages for UP","volume":"58","author":"Hartmanis","year":"1988","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0304-3975(00)00323-6_BIB11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1142\/S0129054191000157","article-title":"On the limitations of locally robust positive reductions","volume":"2","author":"Hemachandra","year":"1991","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB12","doi-asserted-by":"crossref","unstructured":"U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K. Wagner, On the power of polynomial time bit-reductions, Proc. 8th IEEE Structure in Complexity Theory Conf., 1993, pp. 200\u2013207.","DOI":"10.1109\/SCT.1993.336526"},{"issue":"1","key":"10.1016\/S0304-3975(00)00323-6_BIB13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/203610.203611","article-title":"The Satanic notations","volume":"26","author":"Hemaspaandra","year":"1995","journal-title":"SIGACT News"},{"key":"10.1016\/S0304-3975(00)00323-6_BIB14","unstructured":"U. Hertrampf, H. Vollmer, K. Wagner, On balanced vs. unbalanced computation trees, Universit\u00e4t W\u00fcrzburg, Tech. Rep. no. 82, May 1994."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB15","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","article-title":"Languages that capture complexity classes","volume":"16","author":"Immerman","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB16","doi-asserted-by":"crossref","unstructured":"B. Jenner, P. McKenzie, D. Th\u00e9rien, Logspace and logtime leaf languages, Proc. 9th IEEE Structure in Complexity Theory Conf., 1994, pp. 242\u2013254.","DOI":"10.1109\/SCT.1994.315799"},{"year":"1993","series-title":"The Graph Isomorphism Problem","author":"K\u00f6bler","key":"10.1016\/S0304-3975(00)00323-6_BIB17"},{"key":"10.1016\/S0304-3975(00)00323-6_BIB18","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(82)90085-8","article-title":"Strong nondeterministic polynomial-time reducibilities","volume":"21","author":"Long","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB20","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","article-title":"Games against nature","volume":"31","author":"Papadimitriou","year":"1985","journal-title":"J. Comput. System Sci."},{"year":"1994","series-title":"Computational Complexity","author":"Papadimitriou","key":"10.1016\/S0304-3975(00)00323-6_BIB21"},{"key":"10.1016\/S0304-3975(00)00323-6_BIB22","doi-asserted-by":"crossref","unstructured":"U. Sch\u00f6ning, Probabilistic complexity classes and lowness, Proc. 2nd IEEE Structure in Complexity Theory Conf., 1987, pp. 2\u20138.","DOI":"10.1109\/PSCT.1987.10319246"},{"key":"10.1016\/S0304-3975(00)00323-6_BIB23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(82)90039-1","article-title":"Reductions on NP and P-selective sets","volume":"19","author":"Selman","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB24","doi-asserted-by":"crossref","unstructured":"I. Simon, J. Gill, Polynomial reducibilities and upward diagonalizations, Proc. 9th ACM Symp. on Theory of Computing, 1977, pp. 186\u2013194.","DOI":"10.1145\/800105.803408"},{"key":"10.1016\/S0304-3975(00)00323-6_BIB25","first-page":"523","volume":"vol. 140","author":"Sipser","year":"1982"},{"key":"10.1016\/S0304-3975(00)00323-6_BIB26","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/3149.3158","article-title":"A complexity theory based on Boolean algebra","volume":"32","author":"Skyum","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00323-6_BIB27","first-page":"23","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB28","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1137\/0218031","article-title":"On tally relativizations of BP-complexity classes","volume":"18","author":"Tang","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB29","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1137\/0221023","article-title":"Counting classes are at least as hard as the polynomial-time hierarchy","volume":"21","author":"Toda","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB30","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/116825.116858","article-title":"Complexity classes defined by counting quantifiers","volume":"38","author":"Toran","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00323-6_BIB31","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","article-title":"NP is easy as detecting unique solutions","volume":"47","author":"Valiant","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB32","doi-asserted-by":"crossref","unstructured":"H. Veith, Succinct representations and leaf languages, Proc. 11th IEEE Conf. on Computational Complexity, 1996, pp. 118\u2013126.","DOI":"10.1109\/CCC.1996.507675"},{"key":"10.1016\/S0304-3975(00)00323-6_BIB33","first-page":"261","article-title":"Relativizable and nonrelativizable theorems in the polynomial theory of algorithms","volume":"42","author":"Vereshchagin","year":"1994","journal-title":"Russian Acad. Sci. Izv. Math."},{"issue":"1","key":"10.1016\/S0304-3975(00)00323-6_BIB34","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/309739.309741","article-title":"Uniform characterizations of complexity classes","volume":"30","author":"Vollmer","year":"1999","journal-title":"ACM SIGACT-Newslett."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB35","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00289117","article-title":"The complexity of combinatorial problems with succinct input representations","volume":"23","author":"Wagner","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00323-6_BIB36","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Wrathall","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003236?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003236?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:53:32Z","timestamp":1759625612000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":36,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500003236"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00323-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Dot operators","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00323-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}