{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T02:11:12Z","timestamp":1775614272074,"version":"3.50.1"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1016\/j.dam.2024.10.019","type":"journal-article","created":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T21:54:06Z","timestamp":1731362046000},"page":"347-369","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["New theoretical results on the Monotone Boolean Duality and the Monotone Boolean Dualization problems"],"prefix":"10.1016","volume":"361","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-1323-7544","authenticated-orcid":false,"given":"Alice","family":"Raffaele","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-2387-0952","authenticated-orcid":false,"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2024.10.019_b1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02293050","article-title":"A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra","volume":"8","author":"Avis","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.dam.2024.10.019_b2","series-title":"Hypergraphs: Combinatorics of Finite Sets","volume":"vol. 45","author":"Berge","year":"1989"},{"issue":"1","key":"10.1016\/j.dam.2024.10.019_b3","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1006\/inco.1995.1157","article-title":"Complexity of identification and dualization of positive Boolean functions","volume":"123","author":"Bioch","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/j.dam.2024.10.019_b4","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.jcss.2021.10.002","article-title":"Efficiently enumerating hitting sets of hypergraphs arising in data profiling","volume":"124","author":"Bl\u00e4sius","year":"2022","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.dam.2024.10.019_b5","series-title":"Experimental and Efficient Algorithms","first-page":"114","article-title":"An efficient implementation of a joint generation algorithm","author":"Boros","year":"2004"},{"key":"10.1016\/j.dam.2024.10.019_b6","doi-asserted-by":"crossref","first-page":"1624","DOI":"10.1137\/S0097539701388768","article-title":"Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities","volume":"31","author":"Boros","year":"2002","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2024.10.019_b7","series-title":"Proceedings of the Centre de Recherches Math\u00e9matiques at the Universit\u00e9 de Montr\u00e9al, Special Issue on Polyhedral Computation","first-page":"15","article-title":"Generating vertices of polyhedra and related problems of monotone generation","volume":"vol. 49","author":"Boros","year":"2009"},{"issue":"6","key":"10.1016\/j.dam.2024.10.019_b8","doi-asserted-by":"crossref","first-page":"2036","DOI":"10.1137\/S0097539700370072","article-title":"Dual-bounded generating problems: Partial and multiple transversals of a hypergraph","volume":"30","author":"Boros","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2024.10.019_b9","series-title":"Automata, Languages and Programming","first-page":"183","article-title":"A fast and simple parallel algorithm for the monotone duality problem","author":"Boros","year":"2009"},{"issue":"2","key":"10.1016\/j.dam.2024.10.019_b10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0925-7721(98)00021-2","article-title":"The vertex set of a 01-polytope is strongly p-enumerable","volume":"11","author":"Bussieck","year":"1998","journal-title":"Comput. Geom."},{"issue":"3","key":"10.1016\/j.dam.2024.10.019_b11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","article-title":"Bottleneck extrema","volume":"8","author":"Edmonds","year":"1970","journal-title":"J. Combin. Theory"},{"issue":"6","key":"10.1016\/j.dam.2024.10.019_b12","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1137\/S0097539793250299","article-title":"Identifying the minimal transversals of a hypergraph and related problems","volume":"24","author":"Eiter","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.dam.2024.10.019_b13","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/S009753970240639X","article-title":"New results on monotone dualization and generating hypergraph transversals","volume":"32","author":"Eiter","year":"2003","journal-title":"SIAM J. Comput."},{"issue":"11","key":"10.1016\/j.dam.2024.10.019_b14","doi-asserted-by":"crossref","first-page":"2035","DOI":"10.1016\/j.dam.2007.04.017","article-title":"Computational aspects of monotone dualization: A brief survey","volume":"156","author":"Eiter","year":"2008","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"10.1016\/j.dam.2024.10.019_b15","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1016\/j.dam.2007.05.030","article-title":"On the complexity of monotone dualization and generating minimal hypergraph transversals","volume":"156","author":"Elbassioni","year":"2008","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.dam.2024.10.019_b16","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1006\/jagm.1996.0062","article-title":"On the complexity of dualization of monotone disjunctive normal forms","volume":"21","author":"Fredman","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/j.dam.2024.10.019_b17","series-title":"Double Description Method Revisited","first-page":"91","author":"Fukuda","year":"1995"},{"key":"10.1016\/j.dam.2024.10.019_b18","series-title":"Advances in Artificial Intelligence","first-page":"322","article-title":"Average case self-duality of monotone Boolean functions","author":"Gaur","year":"2004"},{"key":"10.1016\/j.dam.2024.10.019_b19","series-title":"Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"209","article-title":"Data mining, hypergraph transversals, and machine learning","author":"Gunopulos","year":"1997"},{"key":"10.1016\/j.dam.2024.10.019_b20","series-title":"Gurobi Optimizer","author":"Gurobi Optimization","year":"2024"},{"key":"10.1016\/j.dam.2024.10.019_b21","series-title":"Algorithmic and Computational Complexity Issues of MONET","author":"Hagen","year":"2008"},{"key":"10.1016\/j.dam.2024.10.019_b22","series-title":"Proceedings of the Meeting on Algorithm Engineering and Experiments","first-page":"154","article-title":"Experimental comparison of the two Fredman-Khachiyan-Algorithms","author":"Hagen","year":"2009"},{"key":"10.1016\/j.dam.2024.10.019_b23","series-title":"ILOG CPLEX optimization studio","author":"IBM","year":"2024"},{"issue":"1","key":"10.1016\/j.dam.2024.10.019_b24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0190(02)00346-0","article-title":"Monotone Boolean dualization is in co-NP[log2n]","volume":"85","author":"Kavvadias","year":"2003","journal-title":"Inform. Process. Lett."},{"issue":"16","key":"10.1016\/j.dam.2024.10.019_b25","doi-asserted-by":"crossref","first-page":"2350","DOI":"10.1016\/j.dam.2006.04.012","article-title":"An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation","volume":"154","author":"Khachiyan","year":"2006","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.dam.2024.10.019_b26","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1137\/S0895480103428338","article-title":"On the complexity of some enumeration problems for matroids","volume":"19","author":"Khachiyan","year":"2005","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"10.1016\/j.dam.2024.10.019_b27","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/0112059","article-title":"A solution of the Shannon switching game","volume":"12","author":"Lehman","year":"1964","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"10.1016\/j.dam.2024.10.019_b28","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF01588263","article-title":"On the width\u2014length inequality","volume":"17","author":"Lehman","year":"1979","journal-title":"Math. Program."},{"key":"10.1016\/j.dam.2024.10.019_b29","series-title":"Combinatorial Optimization: Some Problems and Trends","author":"Lov\u00e1sz","year":"1992"},{"key":"10.1016\/j.dam.2024.10.019_b30","first-page":"51","article-title":"The double description method","volume":"vol. 2","author":"Motzkin","year":"1953"},{"issue":"2","key":"10.1016\/j.dam.2024.10.019_b31","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","article-title":"The complexity of facets (and some facets of complexity)","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.dam.2024.10.019_b32","series-title":"17th International Symposium on Experimental Algorithms","first-page":"6:1","article-title":"Speeding up dualization in the Fredman-Khachiyan Algorithm B","volume":"vol. 103","author":"Sedaghat","year":"2018"},{"issue":"3","key":"10.1016\/j.dam.2024.10.019_b33","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1112\/jlms\/s2-12.3.356","article-title":"The forbidden minors of binary clutters","volume":"s2\u201312","author":"Seymour","year":"1976","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.dam.2024.10.019_b34","first-page":"29","article-title":"Space-efficient enumeration of minimal transversals of a hypergraph","volume":"vol. 75","author":"Tamaki","year":"2000"},{"issue":"4","key":"10.1016\/j.dam.2024.10.019_b35","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1016\/j.ipm.2019.03.003","article-title":"Query-oriented text summarization based on hypergraph transversals","volume":"56","author":"Van Lierde","year":"2019","journal-title":"Inf. Process. Manage."},{"key":"10.1016\/j.dam.2024.10.019_b36","series-title":"Lectures on Polytopes","author":"Ziegler","year":"2012"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X24004542?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X24004542?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T21:47:59Z","timestamp":1738878479000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X24004542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":36,"alternative-id":["S0166218X24004542"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2024.10.019","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"New theoretical results on the Monotone Boolean Duality and the Monotone Boolean Dualization problems","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2024.10.019","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}