{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:10Z","timestamp":1740122410194,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10878-009-9283-0","type":"journal-article","created":{"date-parts":[[2010,1,21]],"date-time":"2010-01-21T20:31:36Z","timestamp":1264105896000},"page":"293-304","source":"Crossref","is-referenced-by-count":6,"title":["On the readability of monotone Boolean formulae"],"prefix":"10.1007","volume":"22","author":[{"given":"Khaled","family":"Elbassioni","sequence":"first","affiliation":[]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[]},{"given":"Imran","family":"Rauf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,22]]},"reference":[{"issue":"1\u20132","key":"9283_CR1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(89)90196-9","volume":"74","author":"M Albertson","year":"1989","unstructured":"Albertson M, Jamison R, Hedetniemi S, Locke S (1989) The subchromatic number of a graph. Discrete Math 74(1\u20132):33\u201349","journal-title":"Discrete Math"},{"issue":"1","key":"9283_CR2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/138027.138061","volume":"40","author":"D Angluin","year":"1993","unstructured":"Angluin D, Hellerstein L, Karpinski M (1993) Learning read-once formulas with queries. J Assoc Comput Math 40(1):185\u2013210","journal-title":"J Assoc Comput Math"},{"key":"9283_CR3","first-page":"15","volume-title":"CRM Proceedings & Lecture Notes, Centre de Recherches Math\u00e9matiques at the Universit\u00e9 de Montr\u00e9al","author":"E Boros","year":"2008","unstructured":"Boros E, Elbassioni K, Gurvich V, Makino K (2008) Generating vertices of polyhedra and related monotone generation problems. In: Avis D, Bremner D, Deza A (eds) CRM Proceedings & Lecture Notes, Centre de Recherches Math\u00e9matiques at the Universit\u00e9 de Montr\u00e9al, vol\u00a048. Am Math Soc, Providence, pp\u00a015\u201339. Special issue on Polyhedral Computation"},{"key":"9283_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","volume":"35","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s P, Rado R (1960) Intersection theorems for systems of sets. J London Math Soc 35:85\u201390","journal-title":"J London Math Soc"},{"issue":"4","key":"9283_CR5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s000370100001","volume":"10","author":"A G\u00e1l","year":"2002","unstructured":"G\u00e1l A (2002) A characterization of span program size and improved lower bounds for monotone span programs. Comput Complex 10(4):277\u2013296","journal-title":"Comput Complex"},{"key":"9283_CR6","doi-asserted-by":"crossref","unstructured":"Golumbic MC, Gurvich V (2010) Read-once functions. In: Crama Y, Hammer PL (eds) Boolean functions: theory, algorithms and applications. Cambridge University Press, Cambridge (in press)","DOI":"10.1017\/CBO9780511852008.011"},{"issue":"10","key":"9283_CR7","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1016\/j.dam.2005.09.016","volume":"154","author":"MC Golumbic","year":"2006","unstructured":"Golumbic MC, Mintz A, Rotics U (2006) Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees. Discrete Appl Math 154(10):1465\u20131477","journal-title":"Discrete Appl Math"},{"key":"9283_CR8","first-page":"183","volume":"32","author":"V Gurvich","year":"1977","unstructured":"Gurvich V (1977) On repetition-free boolean functions. Usp Mat Nauk 32:183\u2013184 (in Russian)","journal-title":"Usp Mat Nauk"},{"issue":"3","key":"9283_CR9","first-page":"721","volume":"43","author":"V Gurvich","year":"1991","unstructured":"Gurvich V (1991) Criteria for repetition-freeness of functions in the algebra of logic. Sov Math Dokl 43(3):721\u2013726","journal-title":"Sov Math Dokl"},{"issue":"1","key":"9283_CR10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0166-218X(99)00099-2","volume":"96\u201397","author":"V Gurvich","year":"1999","unstructured":"Gurvich V, Khachiyan L (1999) On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Discrete Appl Math 96\u201397(1):363\u2013373 http:\/\/dx.doi.org\/10.1016\/S0166-218X(99)00099-2","journal-title":"Discrete Appl Math"},{"issue":"2","key":"9283_CR11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.tcs.2007.03.005","volume":"382","author":"L Khachiyan","year":"2007","unstructured":"Khachiyan L, Boros E, Elbassioni KM, Gurvich V (2007) On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theor Comput Sci 382(2):139\u2013150","journal-title":"Theor Comput Sci"},{"key":"9283_CR12","volume-title":"The complexity of Boolean functions","author":"I Wegener","year":"1987","unstructured":"Wegener I (1987) The complexity of Boolean functions. Wiley, New York"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10878-009-9283-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T18:25:11Z","timestamp":1685384711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9283-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,22]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9283"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9283-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2010,1,22]]}}}