{"id":"https://openalex.org/W2042029993","doi":"https://doi.org/10.1007/bf00289267","title":"The equivalence of Horn and network complexity for Boolean functions","display_name":"The equivalence of Horn and network complexity for Boolean functions","publication_year":1981,"publication_date":"1981-06-01","ids":{"openalex":"https://openalex.org/W2042029993","doi":"https://doi.org/10.1007/bf00289267","mag":"2042029993"},"language":"en","primary_location":{"id":"doi:10.1007/bf00289267","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00289267","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","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/A5025313223","display_name":"Stal O. Anderaa","orcid":null},"institutions":[{"id":"https://openalex.org/I184942183","display_name":"University of Oslo","ror":"https://ror.org/01xtthb56","country_code":"NO","type":"education","lineage":["https://openalex.org/I184942183"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Stal O. Anderaa","raw_affiliation_strings":["Matematisk Institutt, Universitetet i Oslo, Blindern, Oslo, Norway","Matematisk Institutt, Universitetet i Oslo, Blindern, Oslo, Norway#TAB#"],"affiliations":[{"raw_affiliation_string":"Matematisk Institutt, Universitetet i Oslo, Blindern, Oslo, Norway","institution_ids":["https://openalex.org/I184942183"]},{"raw_affiliation_string":"Matematisk Institutt, Universitetet i Oslo, Blindern, Oslo, Norway#TAB#","institution_ids":["https://openalex.org/I184942183"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5098065826","display_name":"Egon B\ufffdrger","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Egon B\ufffdrger","raw_affiliation_strings":["Lehrstuhl Informatik II, Universit\u00e4t Dortmund, Dortmund 50, Germany (Fed. Rep.) 4600#TAB#"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl Informatik II, Universit\u00e4t Dortmund, Dortmund 50, Germany (Fed. Rep.) 4600#TAB#","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025313223"],"corresponding_institution_ids":["https://openalex.org/I184942183"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.735,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.84360391,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":"3","first_page":"303","last_page":"307"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9975000023841858,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9955000281333923,"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.6615044474601746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6547811031341553},{"id":"https://openalex.org/keywords/complexity-index","display_name":"Complexity index","score":0.6266062259674072},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.6057058572769165},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5947418212890625},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5754186511039734},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5372189879417419},{"id":"https://openalex.org/keywords/product-term","display_name":"Product term","score":0.5187878608703613},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5127707123756409},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5040644407272339},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4993257522583008},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.49545347690582275},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.49472615122795105},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47231030464172363},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.4634980857372284},{"id":"https://openalex.org/keywords/french-horn","display_name":"French horn","score":0.4579859972000122},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.4478081166744232},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43820592761039734},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.43400606513023376},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.4223731756210327},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3482794463634491},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30314522981643677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2879641056060791},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.1868901252746582},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09999585151672363},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.09967216849327087}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6615044474601746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6547811031341553},{"id":"https://openalex.org/C6435147","wikidata":"https://www.wikidata.org/wiki/Q5156627","display_name":"Complexity index","level":3,"score":0.6266062259674072},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.6057058572769165},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5947418212890625},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5754186511039734},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5372189879417419},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.5187878608703613},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5127707123756409},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5040644407272339},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4993257522583008},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.49545347690582275},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.49472615122795105},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47231030464172363},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.4634980857372284},{"id":"https://openalex.org/C152076505","wikidata":"https://www.wikidata.org/wiki/Q1126540","display_name":"French horn","level":2,"score":0.4579859972000122},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.4478081166744232},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43820592761039734},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.43400606513023376},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.4223731756210327},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3482794463634491},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30314522981643677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2879641056060791},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.1868901252746582},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09999585151672363},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.09967216849327087},{"id":"https://openalex.org/C169171071","wikidata":"https://www.wikidata.org/wiki/Q5449241","display_name":"Filtered algebra","level":3,"score":0.0},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C19417346","wikidata":"https://www.wikidata.org/wiki/Q7922","display_name":"Pedagogy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf00289267","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00289267","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","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":8,"referenced_works":["https://openalex.org/W78720960","https://openalex.org/W307027764","https://openalex.org/W573171012","https://openalex.org/W1999647826","https://openalex.org/W2036265926","https://openalex.org/W2122786581","https://openalex.org/W2317640827","https://openalex.org/W2977904728"],"related_works":["https://openalex.org/W2131164334","https://openalex.org/W3141532631","https://openalex.org/W2004145437","https://openalex.org/W2686992952","https://openalex.org/W2986911904","https://openalex.org/W2184010066","https://openalex.org/W4231391991","https://openalex.org/W1564702418","https://openalex.org/W2044916592","https://openalex.org/W1926436803"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}