{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:12Z","timestamp":1760202492424},"reference-count":33,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":7777,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0022-0000(92)90024-d","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"302-323","source":"Crossref","is-referenced-by-count":16,"title":["The complexity of circuit value and network stability"],"prefix":"10.1016","volume":"44","author":[{"given":"Ernst W.","family":"Mayr","sequence":"first","affiliation":[]},{"given":"Ashok","family":"Subramanian","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90024-D_BIB1","unstructured":"R. ANDERSON, personal communication."},{"key":"10.1016\/0022-0000(92)90024-D_BIB2","first-page":"17","article-title":"Parallelism and greedy algorithms","volume":"Vol. 4","author":"Anderson","year":"1987"},{"key":"10.1016\/0022-0000(92)90024-D_BIB3","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","article-title":"On relating time and space to size and depth","volume":"6","author":"Borodin","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90024-D_BIB4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","article-title":"Fast parallel matrix and GCD computations","volume":"52","author":"Borodin","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(92)90024-D_BIB5","unstructured":"S. A. COOK, personal communication."},{"key":"10.1016\/0022-0000(92)90024-D_BIB6","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\/0022-0000(92)90024-D_BIB7","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","article-title":"Problems complete for deterministic logarithmic space","volume":"8","author":"Cook","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(92)90024-D_BIB8","unstructured":"T. FEDER, personal communication."},{"key":"10.1016\/0022-0000(92)90024-D_BIB9","series-title":"Proceedings, 21st Annual ACM Symposium on Theory of Computing","first-page":"513","article-title":"A new fixed point approach for stable networks and stable marriages","author":"Feder","year":"1989"},{"key":"10.1016\/0022-0000(92)90024-D_BIB10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Amer. Math. Monthly"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90024-D_BIB11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","article-title":"The monotone and planar circuit value problems are logspace complete for P","volume":"9","author":"Goldschlager","year":"1977","journal-title":"SIGACT News"},{"key":"10.1016\/0022-0000(92)90024-D_BIB12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0304-3975(86)90165-9","article-title":"On the construction of parallel computers from various bases of boolean functions","volume":"43","author":"Goldschlager","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(92)90024-D_BIB13","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(92)90024-D_BIB14","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complementation","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90024-D_BIB15","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\/0022-0000(92)90024-D_BIB16","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/0022-0000(92)90024-D_BIB17","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0022-0000(92)90024-D_BIB18","series-title":"Mariages stables et leurs relations avec d'autres probl\u00e8mes combinatoires","author":"Knuth","year":"1976"},{"issue":"No. 1","key":"10.1016\/0022-0000(92)90024-D_BIB19","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is logspace complete for P","volume":"7","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/0022-0000(92)90024-D_BIB20","series-title":"Concurrent Computations: Algorithms, Architecture, and Technology","first-page":"157","article-title":"The dynamic tree expression problem","author":"Mayr","year":"1988"},{"key":"10.1016\/0022-0000(92)90024-D_BIB21","series-title":"Proceedings, 4th Annual Conference on Structure in Complexity Theory","first-page":"114","article-title":"The complexity of circuit value and network stability","author":"Mayr","year":"1989"},{"key":"10.1016\/0022-0000(92)90024-D_BIB22","first-page":"47","article-title":"Parallel tree contraction, part 1: Fundamentals","volume":"Vol. 5","author":"Miller","year":"1989"},{"key":"10.1016\/0022-0000(92)90024-D_BIB23","series-title":"Proceedings, 19th Annual ACM Symposium on the Theory of Computing","first-page":"392","article-title":"Dynamic parallel complexity of computational circuits","author":"Miller","year":"1987"},{"key":"10.1016\/0022-0000(92)90024-D_BIB24","first-page":"392","article-title":"Systematic methods for tree based parallel algorithm development","volume":"Vol. 2","author":"Miller","year":"1987"},{"key":"10.1016\/0022-0000(92)90024-D_BIB25","series-title":"Proceedings, 14th International Conference on Automata, Languages, and Programming","first-page":"425","article-title":"The lexicographically first maximal subgraph problems: P-completeness and NC algorithms","volume":"Vol. 267","author":"Miyano","year":"1987"},{"key":"10.1016\/0022-0000(92)90024-D_BIB26","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02579205","article-title":"A fast algorithm to compute the rank of a matrix over an arbitrary field","volume":"7","author":"Mulmuley","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0022-0000(92)90024-D_BIB27","series-title":"Notes on Introductory Combinatorics","author":"P\u00f3lya","year":"1983"},{"key":"10.1016\/0022-0000(92)90024-D_BIB28","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90024-D_BIB29","unstructured":"D. SOROKER, personal communication."},{"key":"10.1016\/0022-0000(92)90024-D_BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2273858","article-title":"Classifying the computational complexity of problems","volume":"52","author":"Stockmeyer","year":"1987","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(92)90024-D_BIB31","article-title":"A New Approach to Stable Matching Problems","author":"Subramanian","year":"1989"},{"key":"10.1016\/0022-0000(92)90024-D_BIB32","article-title":"The Computational Complexity of the Circuit Value and Network Stability Problems","author":"Subramanian","year":"1990"},{"key":"10.1016\/0022-0000(92)90024-D_BIB33","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290024D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290024D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:56:58Z","timestamp":1550325418000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290024D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002200009290024D"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90024-d","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}