{"id":"https://openalex.org/W2963526079","doi":"https://doi.org/10.1145/3337787","title":"Representations of Monotone Boolean Functions by Linear Programs","display_name":"Representations of Monotone Boolean Functions by Linear Programs","publication_year":2019,"publication_date":"2019-07-20","ids":{"openalex":"https://openalex.org/W2963526079","doi":"https://doi.org/10.1145/3337787","mag":"2963526079"},"language":"en","primary_location":{"id":"doi:10.1145/3337787","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3337787","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074187313","display_name":"Mateus de Oliveira Oliveira","orcid":"https://orcid.org/0000-0001-7798-7446"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Mateus De Oliveira Oliveira","raw_affiliation_strings":["University of Bergen, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109848440","display_name":"Pavel Pudl\u00e1k","orcid":null},"institutions":[{"id":"https://openalex.org/I202391551","display_name":"Czech Academy of Sciences","ror":"https://ror.org/053avzc18","country_code":"CZ","type":"funder","lineage":["https://openalex.org/I202391551"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Pudl\u00e1k","raw_affiliation_strings":["Czech Academy of Sciences, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Czech Academy of Sciences, Czech Republic","institution_ids":["https://openalex.org/I202391551"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074187313"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":0.388,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63301905,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":"4","first_page":"1","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9952999949455261,"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/monotone-polygon","display_name":"Monotone polygon","score":0.7963336110115051},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.7523014545440674},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6935092210769653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6496313810348511},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5813392996788025},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.48610472679138184},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.4777737855911255},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.4303016662597656},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3501611649990082}],"concepts":[{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7963336110115051},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.7523014545440674},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6935092210769653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6496313810348511},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5813392996788025},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.48610472679138184},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4777737855911255},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.4303016662597656},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3501611649990082},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3337787","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3337787","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323898","display_name":"Bergens Forskningsstiftelse","ror":"https://ror.org/04efaep75"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W14085832","https://openalex.org/W1550421702","https://openalex.org/W1680398520","https://openalex.org/W1755753347","https://openalex.org/W1966278576","https://openalex.org/W1981949200","https://openalex.org/W2011372307","https://openalex.org/W2020513176","https://openalex.org/W2022749269","https://openalex.org/W2033871299","https://openalex.org/W2044095368","https://openalex.org/W2044632231","https://openalex.org/W2045260280","https://openalex.org/W2056382067","https://openalex.org/W2068066892","https://openalex.org/W2069767473","https://openalex.org/W2083193613","https://openalex.org/W2091039687","https://openalex.org/W2106264302","https://openalex.org/W2150285483","https://openalex.org/W2158029166","https://openalex.org/W2162594338","https://openalex.org/W2323554188","https://openalex.org/W2412595538","https://openalex.org/W2565821653","https://openalex.org/W2571456248","https://openalex.org/W2988480584","https://openalex.org/W4238540851"],"related_works":["https://openalex.org/W3204916073","https://openalex.org/W2009341260","https://openalex.org/W2055594799","https://openalex.org/W2403507963","https://openalex.org/W2611822924","https://openalex.org/W2486254595","https://openalex.org/W2799890067","https://openalex.org/W1492165320","https://openalex.org/W3046459465","https://openalex.org/W3198201702"],"abstract_inverted_index":{"We":[0],"introduce":[1],"the":[2,24,49,83,93,100,106],"notion":[3],"of":[4,13,95,102,108,111],"monotone":[5,35,45,59],"linear":[6],"programming":[7],"circuits":[8,30,40,53,104],"(MLP":[9],"circuits),":[10],"a":[11],"model":[12],"computation":[14],"for":[15,63,68,99],"partial":[16],"Boolean":[17,36],"functions.":[18],"Using":[19],"this":[20],"model,":[21],"we":[22,89],"prove":[23],"following":[25],"results.":[26],"1":[27],"(1)":[28],"MLP":[29,39,52,103],"are":[31,41],"superpolynomially":[32],"stronger":[33,43],"than":[34,44],"circuits.":[37],"(2)":[38],"exponentially":[42],"span":[46],"programs":[47],"over":[48],"reals.":[50],"(3)":[51],"can":[54],"be":[55,79],"used":[56],"to":[57],"provide":[58],"feasibility":[60],"interpolation":[61],"theorems":[62],"Lov\u00e1sz-Schrijver":[64,70,75],"proof":[65,71,76,86],"systems":[66],"and":[67,105],"mixed":[69],"systems.":[72],"(4)":[73],"The":[74],"system":[77],"cannot":[78],"polynomially":[80],"simulated":[81],"by":[82],"cutting":[84],"planes":[85],"system.":[87],"Finally,":[88],"establish":[90],"connections":[91],"between":[92],"problem":[94],"proving":[96],"lower":[97],"bounds":[98],"size":[101],"field":[107],"extension":[109],"complexity":[110],"polytopes.":[112]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}