{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T01:41:21Z","timestamp":1773970881739,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1986,5]]},"DOI":"10.1109\/tc.1986.1676783","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"403-418","source":"Crossref","is-referenced-by-count":52,"title":["New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P"],"prefix":"10.1109","volume":"C-35","author":[{"family":"Vitter","sequence":"first","affiliation":[{"name":"Mathematical Sciences Research Institute"}]},{"family":"Simons","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","author":"yasuura","year":"1983","journal-title":"On the parallel computational complexity of unification"},{"key":"ref10","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1008354.1008356"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(83)90045-7"},{"key":"ref13","author":"kanellakis","year":"1984"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.6312171"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/800017.800528"},{"key":"ref16","author":"martelli","year":"1976","journal-title":"Unification in linear time and space A structured presentation"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90043-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.29"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(83)90033-0"},{"key":"ref4","author":"clocksin","year":"1981","journal-title":"Programming in Prolog"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715913"},{"key":"ref3","author":"anderson","year":"1984","journal-title":"Parallelism and greedy algorithms"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/358141.358144"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/800171.809607"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80046-2"},{"key":"ref8","author":"eckstein","year":"0","journal-title":"Simultaneous memory access"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(84)90022-0"},{"key":"ref2","author":"aggarwal","year":"0","journal-title":"A parallel algorithm for the maximal path problem"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22151"},{"key":"ref1","author":"aho","year":"1974","journal-title":"The Design and Analysis of Computer Algorithms"},{"key":"ref20","author":"reif","year":"1983","journal-title":"Depth first search is inherently sequential"},{"key":"ref22","article-title":"parallelism in space-time tradeoffs","author":"savage","year":"1984","journal-title":"Proc Int Workshop VLSI Algorithms Architectures"},{"key":"ref21","first-page":"63","article-title":"computational logic: the unification computation","volume":"6","author":"robinson","year":"1971","journal-title":"Machine Intell"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90010-9"},{"key":"ref23","author":"shapiro","year":"1983","journal-title":"A Subset of Concurrent Prolog and Its Interpreter"},{"key":"ref26","author":"taijan","year":"1983","journal-title":"Data Structures and Network Algorithms"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0213027"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35256\/01676783.pdf?arnumber=1676783","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:05:14Z","timestamp":1753121114000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1676783\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tc.1986.1676783","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,5]]}}}