{"id":"https://openalex.org/W1968216136","doi":"https://doi.org/10.1515/dma.1994.4.3.273","title":"Complexity of Boolean functions in the class of canonical polarized polynomials","display_name":"Complexity of Boolean functions in the class of canonical polarized polynomials","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W1968216136","doi":"https://doi.org/10.1515/dma.1994.4.3.273","mag":"1968216136"},"language":"en","primary_location":{"id":"doi:10.1515/dma.1994.4.3.273","doi":"https://doi.org/10.1515/dma.1994.4.3.273","is_oa":false,"landing_page_url":"https://doi.org/10.1515/dma.1994.4.3.273","pdf_url":null,"source":{"id":"https://openalex.org/S107669889","display_name":"Discrete Mathematics and Applications","issn_l":"0924-9265","issn":["0924-9265","0924-9266","1569-3929"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics and Applications","raw_type":"journal-article"},"volume":null,"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/A5058234864","display_name":"V. P. Suprun","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"V. P. SUPRUN","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5058234864"],"corresponding_institution_ids":[],"apc_list":{"value":2400,"currency":"EUR","value_usd":2712},"apc_paid":null,"fwci":0.4842,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.59724024,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"4","issue":"3","first_page":null,"last_page":null},"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.6244999766349792,"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.6244999766349792,"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/T11130","display_name":"Coding theory and cryptography","score":0.18199999630451202,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.06069999933242798,"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-functions","display_name":"Boolean functions","score":0.9330000281333923},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6660000085830688},{"id":"https://openalex.org/keywords/boolean-polynomials","display_name":"Boolean polynomials","score":0.546999990940094}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8517670035362244},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.7266421318054199},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5339390635490417},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41010114550590515},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.36817073822021484},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3612573742866516},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.33080974221229553},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06949403882026672},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05762898921966553}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1515/dma.1994.4.3.273","doi":"https://doi.org/10.1515/dma.1994.4.3.273","is_oa":false,"landing_page_url":"https://doi.org/10.1515/dma.1994.4.3.273","pdf_url":null,"source":{"id":"https://openalex.org/S107669889","display_name":"Discrete Mathematics and Applications","issn_l":"0924-9265","issn":["0924-9265","0924-9266","1569-3929"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2769311189","https://openalex.org/W2757592132","https://openalex.org/W2520507268","https://openalex.org/W2493610950","https://openalex.org/W2089168134","https://openalex.org/W1562813469","https://openalex.org/W2193995032","https://openalex.org/W1507532953","https://openalex.org/W2150272262","https://openalex.org/W2017059367","https://openalex.org/W3022280934","https://openalex.org/W2981485902","https://openalex.org/W2003449723","https://openalex.org/W2016237624","https://openalex.org/W2360501481","https://openalex.org/W2094060015","https://openalex.org/W2233643900","https://openalex.org/W2752537206","https://openalex.org/W1966596853","https://openalex.org/W3140194666"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}