{"id":"https://openalex.org/W203898772","doi":"https://doi.org/10.1016/0304-3975(79)90008-2","title":"Switching functions whose monotone complexity is nearly quadratic","display_name":"Switching functions whose monotone complexity is nearly quadratic","publication_year":1979,"publication_date":"1979-07-01","ids":{"openalex":"https://openalex.org/W203898772","doi":"https://doi.org/10.1016/0304-3975(79)90008-2","mag":"203898772"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(79)90008-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(79)90008-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5075262791","display_name":"Ingo Wegener","orcid":null},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Ingo Wegener","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik der Universitat Bielefeld, Universit\u00e4tsstra\u00dfe 1, 4800 Bielefeld 1, Federal Republic of Germany"],"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik der Universitat Bielefeld, Universit\u00e4tsstra\u00dfe 1, 4800 Bielefeld 1, Federal Republic of Germany","institution_ids":["https://openalex.org/I20121455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5075262791"],"corresponding_institution_ids":["https://openalex.org/I20121455"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.5817,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59949251,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"1","first_page":"83","last_page":"97"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9896000027656555,"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.8910622596740723},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.6707251667976379},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5860951542854309},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5847223401069641},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5256869792938232},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4555895924568176},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43413281440734863},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4114105999469757},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34271758794784546},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24030229449272156},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08561745285987854},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.052418023347854614}],"concepts":[{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.8910622596740723},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6707251667976379},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5860951542854309},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5847223401069641},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5256869792938232},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4555895924568176},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43413281440734863},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4114105999469757},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34271758794784546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24030229449272156},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08561745285987854},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.052418023347854614},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(79)90008-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(79)90008-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2020707942","https://openalex.org/W2035476608","https://openalex.org/W2569195351","https://openalex.org/W6729749364"],"related_works":["https://openalex.org/W2041228989","https://openalex.org/W2079209861","https://openalex.org/W2571456248","https://openalex.org/W2002337670","https://openalex.org/W2084152790","https://openalex.org/W3200593953","https://openalex.org/W3038027215","https://openalex.org/W3170515206","https://openalex.org/W2015499611","https://openalex.org/W2142356657","https://openalex.org/W2918305008","https://openalex.org/W2952208743","https://openalex.org/W2020346765","https://openalex.org/W1963927532","https://openalex.org/W3106231679","https://openalex.org/W2025576605","https://openalex.org/W2129485442","https://openalex.org/W1682673340","https://openalex.org/W1580860198","https://openalex.org/W2179410341"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2016-06-24T00:00:00"}