{"id":"https://openalex.org/W2062322643","doi":"https://doi.org/10.1016/0020-0190(83)90051-0","title":"A measure in which Boolean negation is exponentially powerful","display_name":"A measure in which Boolean negation is exponentially powerful","publication_year":1983,"publication_date":"1983-10-01","ids":{"openalex":"https://openalex.org/W2062322643","doi":"https://doi.org/10.1016/0020-0190(83)90051-0","mag":"2062322643"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(83)90051-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(83)90051-0","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","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/A5017408163","display_name":"Sven Skyum","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Sven Skyum","raw_affiliation_strings":["Computer Science Department, Aarhus University, DK 8000 Aarhus C, Denmark","Department of Computer Science, Faculty of Science, Aarhus University, Aarhus University"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Aarhus University, DK 8000 Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Department of Computer Science, Faculty of Science, Aarhus University, Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017408163"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":1.1346,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77575507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"3","first_page":"125","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9937000274658203,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.993399977684021,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7670245170593262},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6595505475997925},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6004363894462585},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5640595555305481},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5532224178314209},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.5125858187675476},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.49257999658584595},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.43980303406715393},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41189149022102356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.331557959318161},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08945652842521667},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06902074813842773}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7670245170593262},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6595505475997925},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6004363894462585},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5640595555305481},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5532224178314209},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.5125858187675476},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.49257999658584595},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.43980303406715393},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41189149022102356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.331557959318161},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08945652842521667},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06902074813842773},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0020-0190(83)90051-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(83)90051-0","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/8cd7c4ce-295d-4296-9992-32596c587d8f","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/8cd7c4ce-295d-4296-9992-32596c587d8f","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Skyum, S 1983, 'A measure in which Boolean negation is exponentially powerful', Information Processing Letters, vol. 17, no. 3, pp. 125-128. https://doi.org/10.1016/0020-0190(83)90051-0","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5099999904632568,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1533538517","https://openalex.org/W1976626676","https://openalex.org/W2068330457","https://openalex.org/W2170831059","https://openalex.org/W2474705870","https://openalex.org/W6667675714","https://openalex.org/W6685152964"],"related_works":["https://openalex.org/W3212703233","https://openalex.org/W2150974517","https://openalex.org/W2728195892","https://openalex.org/W2611822924","https://openalex.org/W2486254595","https://openalex.org/W1750931500","https://openalex.org/W3204916073","https://openalex.org/W2516690985","https://openalex.org/W2063425181","https://openalex.org/W2055594799"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}