{"id":"https://openalex.org/W2091423939","doi":"https://doi.org/10.1016/s0304-3975(99)00182-6","title":"On the multiplicative complexity of Boolean functions over the basis (\u2227,\u2295,1)","display_name":"On the multiplicative complexity of Boolean functions over the basis (\u2227,\u2295,1)","publication_year":2000,"publication_date":"2000-03-01","ids":{"openalex":"https://openalex.org/W2091423939","doi":"https://doi.org/10.1016/s0304-3975(99)00182-6","mag":"2091423939"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(99)00182-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(99)00182-6","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/A5068354624","display_name":"Joan Boyar","orcid":"https://orcid.org/0000-0002-0725-8341"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joan Boyar","raw_affiliation_strings":["Department of Mathematics and Computer Science, Odense University, Denmark","Odense University , Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Odense University, Denmark","institution_ids":[]},{"raw_affiliation_string":"Odense University , Denmark","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055675166","display_name":"Ren\u00e9 Peralta","orcid":"https://orcid.org/0000-0002-2318-7563"},"institutions":[{"id":"https://openalex.org/I43579087","display_name":"University of Wisconsin\u2013Milwaukee","ror":"https://ror.org/031q21x57","country_code":"US","type":"education","lineage":["https://openalex.org/I43579087"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ren\u00e9 Peralta","raw_affiliation_strings":["Center for Cryptography, Computer, and Network Security, Computer Science Department, University of Wisconsin-Milwaukee, Milwaukee, WI 53201, USA","Univ. of Wisconsin Milwaukee"],"affiliations":[{"raw_affiliation_string":"Center for Cryptography, Computer, and Network Security, Computer Science Department, University of Wisconsin-Milwaukee, Milwaukee, WI 53201, USA","institution_ids":["https://openalex.org/I43579087"]},{"raw_affiliation_string":"Univ. of Wisconsin Milwaukee","institution_ids":["https://openalex.org/I43579087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007503443","display_name":"Denis Pochuev","orcid":null},"institutions":[{"id":"https://openalex.org/I43579087","display_name":"University of Wisconsin\u2013Milwaukee","ror":"https://ror.org/031q21x57","country_code":"US","type":"education","lineage":["https://openalex.org/I43579087"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Denis Pochuev","raw_affiliation_strings":["Center for Cryptography, Computer, and Network Security, Computer Science Department, University of Wisconsin-Milwaukee, Milwaukee, WI 53201, USA","Univ. of Wisconsin Milwaukee"],"affiliations":[{"raw_affiliation_string":"Center for Cryptography, Computer, and Network Security, Computer Science Department, University of Wisconsin-Milwaukee, Milwaukee, WI 53201, USA","institution_ids":["https://openalex.org/I43579087"]},{"raw_affiliation_string":"Univ. of Wisconsin Milwaukee","institution_ids":["https://openalex.org/I43579087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055675166"],"corresponding_institution_ids":["https://openalex.org/I43579087"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.5332,"has_fulltext":false,"cited_by_count":93,"citation_normalized_percentile":{"value":0.77433713,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":"235","issue":"1","first_page":"43","last_page":"57"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9958000183105469,"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/boolean-function","display_name":"Boolean function","score":0.7660388946533203},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7413034439086914},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.6838971376419067},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6720355749130249},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5982922315597534},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5722111463546753},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5574477314949036},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5437480211257935},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5192894339561462},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.5186185240745544},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4596116244792938},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4451243579387665},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.18284621834754944}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7660388946533203},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7413034439086914},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.6838971376419067},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6720355749130249},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5982922315597534},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5722111463546753},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5574477314949036},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5437480211257935},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5192894339561462},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.5186185240745544},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4596116244792938},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4451243579387665},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.18284621834754944},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/s0304-3975(99)00182-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(99)00182-6","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"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/77716360-ba97-11dc-9626-000ea68e967b","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/77716360-ba97-11dc-9626-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Boyar, J, Peralta, R & Pochuev, D 2000, 'On the multiplicative complexity of boolean functions over the basis (AND, XOR, 1)', Theoretical Computer Science, vol. 235, pp. 43-57. https://doi.org/10.1016/S0304-3975(99)00182-6","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W179236949","https://openalex.org/W1517585663","https://openalex.org/W1572584518","https://openalex.org/W1587602953","https://openalex.org/W1974331311","https://openalex.org/W1989734466","https://openalex.org/W2005874499","https://openalex.org/W2026273432","https://openalex.org/W2029948740","https://openalex.org/W2068422506","https://openalex.org/W2094454303"],"related_works":["https://openalex.org/W2106622045","https://openalex.org/W2009341260","https://openalex.org/W2952185983","https://openalex.org/W3204916073","https://openalex.org/W2055594799","https://openalex.org/W2516690985","https://openalex.org/W2611822924","https://openalex.org/W1564702418","https://openalex.org/W1493450096","https://openalex.org/W1995176744"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}