{"id":"https://openalex.org/W2159727921","doi":"https://doi.org/10.1007/s10878-009-9283-0","title":"On the readability of monotone Boolean formulae","display_name":"On the readability of monotone Boolean formulae","publication_year":2010,"publication_date":"2010-01-21","ids":{"openalex":"https://openalex.org/W2159727921","doi":"https://doi.org/10.1007/s10878-009-9283-0","mag":"2159727921"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-009-9283-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-009-9283-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-009-9283-0.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-009-9283-0.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000070192","display_name":"Khaled Elbassioni","orcid":"https://orcid.org/0000-0001-7021-5400"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Khaled Elbassioni","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110768204","display_name":"Kazuhisa Makino","orcid":"https://orcid.org/0009-0000-9771-4955"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kazuhisa Makino","raw_affiliation_strings":["Department of Mathematical Informatics, University of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Informatics, University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107922230","display_name":"Imran Rauf","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Imran Rauf","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000070192"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.1493891,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"22","issue":"3","first_page":"293","last_page":"304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7931588292121887},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7442030906677246},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6604927778244019},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6365945339202881},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.6353508234024048},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5989382266998291},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5919321775436401},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5225431323051453},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.5170746445655823},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5043250322341919},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5041817426681519},{"id":"https://openalex.org/keywords/disjunctive-normal-form","display_name":"Disjunctive normal form","score":0.49938082695007324},{"id":"https://openalex.org/keywords/product-term","display_name":"Product term","score":0.48339834809303284},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.46906113624572754},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.3479072153568268},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.22465255856513977},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.12216365337371826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12153550982475281},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.11651545763015747}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7931588292121887},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7442030906677246},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6604927778244019},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6365945339202881},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6353508234024048},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5989382266998291},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5919321775436401},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5225431323051453},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.5170746445655823},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5043250322341919},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5041817426681519},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.49938082695007324},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.48339834809303284},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.46906113624572754},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.3479072153568268},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.22465255856513977},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.12216365337371826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12153550982475281},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.11651545763015747},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C169171071","wikidata":"https://www.wikidata.org/wiki/Q5449241","display_name":"Filtered algebra","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-009-9283-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-009-9283-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-009-9283-0.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:22:y:2011:i:3:d:10.1007_s10878-009-9283-0","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-009-9283-0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:edoc.mpg.de:618645","is_oa":false,"landing_page_url":"http://edoc.mpg.de/618645","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, v.22, 293-304 (2011)","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1007/s10878-009-9283-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-009-9283-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-009-9283-0.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2159727921.pdf","grobid_xml":"https://content.openalex.org/works/W2159727921.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1517585663","https://openalex.org/W1532196532","https://openalex.org/W1550421702","https://openalex.org/W1964114184","https://openalex.org/W1996070840","https://openalex.org/W2016341899","https://openalex.org/W2020774087","https://openalex.org/W2025532110","https://openalex.org/W2071210909","https://openalex.org/W2394726741","https://openalex.org/W4206794571"],"related_works":["https://openalex.org/W1534775143","https://openalex.org/W2996462315","https://openalex.org/W2883069340","https://openalex.org/W3141532631","https://openalex.org/W2131164334","https://openalex.org/W4252281389","https://openalex.org/W4289743389","https://openalex.org/W2009700110","https://openalex.org/W2460779241","https://openalex.org/W2159727921"],"abstract_inverted_index":{"Golumbic":[0],"et":[1],"al.":[2],"(Discrete":[3],"Appl.":[4],"Math.":[5],"154:1465\u20131477,":[6],"2006)":[7],"defined":[8],"the":[9,19,112,137,152,157,160,169,175,184,187,210],"readability":[10,113,138],"of":[11,114,126,139,154,172,177,181,186,197,200],"a":[12,46,51,65,69,92,97,115,124,140,198],"monotone":[13,52,94,117,141],"Boolean":[14,53,118,142],"function":[15,54,119,143],"f":[16,31,63],"to":[17,30,89,110],"be":[18,190],"minimum":[20],"integer":[21],"k":[22,39],"such":[23],"that":[24,85,106,193],"there":[25,44],"exists":[26,45],"an":[27],"\u2227\u2212\u2228-formula":[28],"equivalent":[29],"in":[32,56,145,156,163,174],"which":[33,49],"each":[34,164,194],"variable":[35],"appears":[36],"at":[37],"most":[38],"times.":[40],"They":[41],"asked":[42],"whether":[43,62],"polynomial-time":[47],"algorithm,":[48],"given":[50,93,116,144],"f,":[55],"CNF":[57,146,158],"or":[58,166],"DNF":[59,188],"form,":[60,149],"checks":[61],"is":[64,87,108],"read-k":[66],"function,":[67],"for":[68,81],"fixed":[70],"k.":[71],"In":[72],"this":[73,78],"paper,":[74],"we":[75,203],"partially":[76],"answer":[77],"question":[79],"already":[80],"k=2":[82],"by":[83,151],"showing":[84],"it":[86,107],"NP-hard":[88,109],"decide":[90],"if":[91],"formula":[95],"represents":[96],"read-twice":[98],"function.":[99],"It":[100],"follows":[101],"also":[102,130],"from":[103],"our":[104],"reduction":[105],"approximate":[111],"f:{0,1}":[120],"n":[121],"\u2192{0,1}":[122],"within":[123],"factor":[125],"$\\mathcal{O}(n)$":[127],".":[128],"We":[129],"give":[131,204],"tight":[132],"sublinear":[133],"upper":[134],"bounds":[135,208],"on":[136,209],"(or":[147],"DNF)":[148],"parameterized":[150],"number":[153,171,180],"terms":[155],"and":[159],"maximum":[161,170],"size":[162],"term,":[165],"more":[167],"generally":[168],"variables":[173,185],"intersection":[176],"any":[178],"constant":[179],"terms.":[182],"When":[183],"can":[189],"ordered":[191],"so":[192],"term":[195],"consists":[196],"set":[199],"consecutive":[201],"variables,":[202],"much":[205],"tighter":[206],"logarithmic":[207],"readability.":[211]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}