{"id":"https://openalex.org/W1714759042","doi":"https://doi.org/10.1007/3-540-13331-3_58","title":"Proving lower bounds on the monotone complexity of Boolean functions","display_name":"Proving lower bounds on the monotone complexity of Boolean functions","publication_year":1984,"publication_date":"1984-01-01","ids":{"openalex":"https://openalex.org/W1714759042","doi":"https://doi.org/10.1007/3-540-13331-3_58","mag":"1714759042"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-13331-3_58","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-13331-3_58","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5075262791","display_name":"Ingo Wegener","orcid":null},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Ingo Wegener","raw_affiliation_strings":["FB-20 Informatik, Johann Wolfgang Goethe-Universit\u00e4t, 6000, Frankfurt a.M., Fed. Rep. of Germany","FB-20 Informatik, Johann Wolfgang Goethe-Universit\u00e4t"],"affiliations":[{"raw_affiliation_string":"FB-20 Informatik, Johann Wolfgang Goethe-Universit\u00e4t, 6000, Frankfurt a.M., Fed. Rep. of Germany","institution_ids":["https://openalex.org/I114090438"]},{"raw_affiliation_string":"FB-20 Informatik, Johann Wolfgang Goethe-Universit\u00e4t","institution_ids":["https://openalex.org/I114090438"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5075262791"],"corresponding_institution_ids":["https://openalex.org/I114090438"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.23174294,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"446","last_page":"456"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9333999752998352,"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.9333999752998352,"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/boolean-function","display_name":"Boolean function","score":0.8038715124130249},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7802680730819702},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.6787238121032715},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.6608415246009827},{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.5948976278305054},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.586292028427124},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5761393308639526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5610402822494507},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5543691515922546},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5237700343132019},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.5075985193252563},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.503497302532196},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4835672080516815},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.4635884463787079},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4179025888442993},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37521785497665405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30996960401535034},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.14306640625}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.8038715124130249},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7802680730819702},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.6787238121032715},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.6608415246009827},{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.5948976278305054},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.586292028427124},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5761393308639526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5610402822494507},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5543691515922546},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5237700343132019},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.5075985193252563},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.503497302532196},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4835672080516815},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.4635884463787079},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4179025888442993},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37521785497665405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30996960401535034},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.14306640625},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-13331-3_58","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-13331-3_58","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1495932320","https://openalex.org/W2002337670","https://openalex.org/W2007643676","https://openalex.org/W2007805020","https://openalex.org/W2020707942","https://openalex.org/W2035081987","https://openalex.org/W2041228989","https://openalex.org/W2050585014","https://openalex.org/W2056094722","https://openalex.org/W2330503368","https://openalex.org/W2532640196","https://openalex.org/W2569195351","https://openalex.org/W4230950430"],"related_works":["https://openalex.org/W2327772356","https://openalex.org/W4231391991","https://openalex.org/W1967292023","https://openalex.org/W2995617542","https://openalex.org/W2011469629","https://openalex.org/W1564702418","https://openalex.org/W2918709778","https://openalex.org/W2131164334","https://openalex.org/W1976287608","https://openalex.org/W3049543508"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}