{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:54:50Z","timestamp":1720054490397},"reference-count":15,"publisher":"Elsevier BV","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 Mathematics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0012-365x(96)00163-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:12:16Z","timestamp":1027584736000},"page":"81-100","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["On perfect 0, \u00b1 1 matrices"],"prefix":"10.1016","volume":"165-166","author":[{"given":"Endre","family":"Boros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"\u010cepek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00163-X_BIB1","first-page":"121","article-title":"Polynomial time inference of all valid implications for Horn and related formulae","volume":"8","author":"Boros","year":"1990","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0012-365X(96)00163-X_BIB2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1137\/S0097539792228629","article-title":"A complexity index for satisfiability problems","volume":"23","author":"Boros","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(96)00163-X_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(94)90033-7","article-title":"Recognition of q-Horn formulae in linear time","volume":"55","author":"Boros","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00163-X_BIB4","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","article-title":"On certain polytopes associated with graphs","volume":"18","author":"Chv\u00e1tal","year":"1975","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(96)00163-X_BIB5","unstructured":"M. Conforti, G. Cornu\u00e9jols and C. De Francesco, Perfect 0,\u00b11 matrices, Working Paper, University of Padova, Linear Algebra Appl., to appear."},{"key":"10.1016\/S0012-365X(96)00163-X_BIB6","series-title":"The State of the Art: Mathematical Programming","article-title":"Balanced matrices","author":"Conforti","year":"1994"},{"key":"10.1016\/S0012-365X(96)00163-X_BIB7","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01584992","article-title":"Polyhedral sets having a least element","volume":"3","author":"Cottle","year":"1972","journal-title":"Math. Programming"},{"key":"10.1016\/S0012-365X(96)00163-X_BIB8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0095-8956(72)90032-9","article-title":"Anti-blocking polyhedra","volume":"12","author":"Fulkerson","year":"1972","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(96)00163-X_BIB9","series-title":"Perfect and ideal 0,\u00b11 matrices","author":"Guenin","year":"1994"},{"key":"10.1016\/S0012-365X(96)00163-X_BIB10_1","doi-asserted-by":"crossref","DOI":"10.1109\/69.469822","article-title":"Quasi-acyclic propositional Horn knowledge bases: optimal compression","author":"Hammer","year":"1993"},{"key":"10.1016\/S0012-365X(96)00163-X_BIB10_2","author":"Hammer","year":"1995","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/S0012-365X(96)00163-X_BIB11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00163-X_BIB12","first-page":"29","article-title":"Normal hypergraphs and the weak perfect graph conjecture","volume":"21","author":"Lov\u00e1sz","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00163-X_BIB13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(96)00163-X_BIB14","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0095-8956(82)90028-4","article-title":"Alpha-balanced graphs and matrices and GF(3)-representability of matroids","volume":"32","author":"Truemper","year":"1982","journal-title":"J. Combin. Theory B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600163X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600163X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:21:31Z","timestamp":1556652091000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9600163X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":15,"alternative-id":["S0012365X9600163X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00163-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}