{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:46:40Z","timestamp":1774626400581,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0166-218x(96)00111-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:12:16Z","timestamp":1027599136000},"page":"289-295","source":"Crossref","is-referenced-by-count":2,"title":["Note on complexity of computing the domination of binary systems"],"prefix":"10.1016","volume":"73","author":[{"given":"A.A.","family":"Chernyak","sequence":"first","affiliation":[]},{"given":"Zh.A.","family":"Chernyak","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00111-4_BIB1","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1287\/opre.36.5.703","article-title":"Disjoint products and efficient computation of reliability","volume":"36","author":"Ball","year":"1988","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00111-4_BIB2","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1017\/S0269964800000164","article-title":"Computational complexity of coherent systems and the reliability polynomial","volume":"2","author":"Barlow","year":"1988","journal-title":"Prob. Engin. Inform. Sci."},{"key":"10.1016\/S0166-218X(96)00111-4_BIB3","first-page":"572","article-title":"Combinatorial-graph method for reliability analysis of complex systems with monotonic boolean functions","volume":"52","author":"Chernyak","year":"1991","journal-title":"Automat. Remote Control"},{"key":"10.1016\/S0166-218X(96)00111-4_BIB4","series-title":"Proceedings 8th International Symposium on Reliability in Electronics","first-page":"135","article-title":"A new graph-combinatorial method for reliability analysis of monotone graphs","author":"Chernyak","year":"1991"},{"key":"10.1016\/S0166-218X(96)00111-4_BIB5","series-title":"International Mathematical Congress in Berne","article-title":"Computational complexity of domination and reliability of binary systems","author":"Chernyak","year":"1994"},{"key":"10.1016\/S0166-218X(96)00111-4_BIB6","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/24.488926","article-title":"A unified domination approach for reliability analysis of networks with threshold logic in vertices","volume":"45","author":"Chernyak","year":"1996","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/S0166-218X(96)00111-4_BIB7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/net.3230200107","article-title":"Directed network reliability: domination and computing coefficients of the success-marginal expansion","volume":"20","author":"Hagstrom","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(96)00111-4_BIB8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.3230190111","article-title":"Domination theory and Crapo b-invariant","volume":"19","author":"Huseby","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(96)00111-4_BIB9","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","article-title":"The complexity of counting cuts and of computing the probability that a graph is connected","volume":"12","author":"Provan","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(96)00111-4_BIB10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0012-365X(85)90080-9","article-title":"Threshold hypergraphs","volume":"54","author":"Reiterman","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(96)00111-4_BIB11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TR.1982.5221215","article-title":"A unified formula for analysis of some network reliability problems","volume":"R-31","author":"Satyanarayana","year":"1982","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/S0166-218X(96)00111-4_BIB12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/net.3230130107","article-title":"Network reliability and factoring theorem","volume":"13","author":"Satyanarayana","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(96)00111-4_BIB13","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/TR.1978.5220266","article-title":"New topological formula and rapid algorithm for reliability analysis of complex networks","volume":"R-27","author":"Satyanarayana","year":"1978","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/S0166-218X(96)00111-4_BIB14","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96001114?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96001114?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:26:20Z","timestamp":1556666780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96001114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0166218X96001114"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00111-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}