{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T06:40:15Z","timestamp":1780382415005,"version":"3.54.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7259,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0304-3975(93)90109-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"193-229","source":"Crossref","is-referenced-by-count":13,"title":["Methods for proving completeness via logical reductions"],"prefix":"10.1016","volume":"118","author":[{"given":"Iain","family":"Stewart A.","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90109-7_BIB1","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","article-title":"On uniformity within NC1","volume":"41","author":"Barrington","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90109-7_BIB2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90109-7_BIB3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90109-7_BIB4","first-page":"357","article-title":"Reduction to NP-complete problems by interpretations","volume":"Vol. 171","author":"Dahlhaus","year":"1984"},{"key":"10.1016\/0304-3975(93)90109-7_BIB5","series-title":"Complexity of Computation","first-page":"27","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"Vol. 7","author":"Fagin","year":"1974"},{"issue":"3","key":"10.1016\/0304-3975(93)90109-7_BIB6","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/TSE.1976.233819","article-title":"On two problems in the generation of test paths","volume":"SE-2","author":"Gabow","year":"1976","journal-title":"IEEE Trans. Soft. Eng."},{"key":"10.1016\/0304-3975(93)90109-7_BIB7","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(93)90109-7_BIB8","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\/0304-3975(93)90109-7_BIB9","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Non-deterministic space is closed under complementation","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90109-7_BIB10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/psapm\/038\/1020810","article-title":"Descriptive and computational complexity","volume":"Vol. 38","author":"Immerman","year":"1989","journal-title":"Computational Complexity Theory, Proc. AMS Symp. in Appl. Math."},{"key":"10.1016\/0304-3975(93)90109-7_BIB11","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1109\/SCT.1989.41816","article-title":"The complexity of iterated multiplication","author":"Immerman","year":"1989","journal-title":"Proc. 4th IEEE Symp. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(93)90109-7_BIB12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space-bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90109-7_BIB13","first-page":"40","article-title":"The subgraph homeomorphism problem","author":"Lapaugh","year":"1978","journal-title":"Proc. 10th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(93)90109-7_BIB14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(82)90058-5","article-title":"Symmetric space bounded computation","volume":"19","author":"Lewis","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90109-7_BIB15","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1002\/malq.19770233608","article-title":"Some remarks on generalized spectra","volume":"23","author":"Lovasz","year":"1977","journal-title":"Zeitschr.f.math. Logik und Grundlagen d. Math."},{"key":"10.1016\/0304-3975(93)90109-7_BIB16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0890-5401(90)90046-K","article-title":"Polynomial size \u03a9-branching programs and their computational complexity","volume":"85","author":"Meinel","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90109-7_BIB17","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0022-0000(73)80031-5","article-title":"Maze recognizing automata and non-deterministic space complexity","volume":"7","author":"Savitch","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90109-7_BIB18","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\/0304-3975(93)90109-7_BIB19_1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0022-0000(92)90043-I","article-title":"Using the Hamiltonian path operator to capture NP","volume":"45","author":"Stewart","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90109-7_BIB19_2","first-page":"134","article-title":"Using the Hamiltonian path operator to capture NP","volume":"Vol. 468","author":"Stewart","year":"1990"},{"key":"10.1016\/0304-3975(93)90109-7_BIB20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0020-0190(91)90121-W","article-title":"Complete problems for symmetric logspace involving free groups","volume":"40","author":"Stewart","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(93)90109-7_BIB21","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1093\/logcom\/1.3.305","article-title":"Comparing the expressibility of languages formed using NP-complete operators","volume":"1","author":"Stewart","year":"1991","journal-title":"J. Logic Computat."},{"key":"10.1016\/0304-3975(93)90109-7_BIB22","first-page":"198","article-title":"Complete problems for logspace involving lexicographic first paths in graphs","volume":"Vol. 570","author":"Stewart","year":"1991"},{"key":"10.1016\/0304-3975(93)90109-7_BIB23","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1093\/logcom\/1.6.861","article-title":"Complete problems involving Boolean labelled structures and projection translations","volume":"1","author":"Stewart","year":"1991","journal-title":"J. Logic Computat."},{"key":"10.1016\/0304-3975(93)90109-7_BIB24","series-title":"Math. Systems Theory","first-page":"353","article-title":"On completeness for NP via projection translations","volume":"Vol. 626","author":"Stewart","year":"1992"},{"key":"10.1016\/0304-3975(93)90109-7_BIB25","doi-asserted-by":"crossref","unstructured":"I.A. Stewart, Logical characterizations of bounded query classes II: polynomial-time oracle machines, Fund. Inform., to appear, extended abstract in: Proc. CSL '92, Lecture Notes in Computer Science (Springer, Berlin), to appear.","DOI":"10.1007\/3-540-56992-8_25"},{"key":"10.1016\/0304-3975(93)90109-7_BIB26","series-title":"Tech. Report No. 334","article-title":"Uniform sequences of branching programs","author":"Stewart","year":"1991"},{"key":"10.1016\/0304-3975(93)90109-7_BIB27","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1142\/S0218196792000141","article-title":"The complexity of restricted versions of the generalized word problem for free groups","volume":"2","author":"Stewart","year":"1992","journal-title":"Int. J. Algebra and Comput."},{"key":"10.1016\/0304-3975(93)90109-7_BIB28","series-title":"Fund. Inform.","first-page":"470","article-title":"Logical characterizations of bounded query classes I: logspace oracle machines","volume":"Vol. 620","author":"Stewart","year":"1992"},{"key":"10.1016\/0304-3975(93)90109-7_BIB29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90109-7_BIB30","first-page":"260","article-title":"Bounded query computations","author":"Wagner","year":"1988","journal-title":"Proc. 3rd IEEE Symp. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(93)90109-7_BIB31","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1137\/0219058","article-title":"Bounded query classes","volume":"19","author":"Wagner","year":"1990","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593901097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593901097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:24:26Z","timestamp":1555129466000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593901097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["0304397593901097"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90109-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}