{"id":"https://openalex.org/W2139416030","doi":"https://doi.org/10.1109/ismvl.2004.1319960","title":"A polynomial time algorithm for non-disjoint decomposition of multiple-valued functions","display_name":"A polynomial time algorithm for non-disjoint decomposition of multiple-valued functions","publication_year":2004,"publication_date":"2004-09-28","ids":{"openalex":"https://openalex.org/W2139416030","doi":"https://doi.org/10.1109/ismvl.2004.1319960","mag":"2139416030"},"language":"en","primary_location":{"id":"doi:10.1109/ismvl.2004.1319960","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ismvl.2004.1319960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 34th International Symposium on Multiple-Valued Logic","raw_type":"proceedings-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/A5011438358","display_name":"Elena Dubrova","orcid":"https://orcid.org/0000-0001-7382-9408"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]},{"id":"https://openalex.org/I4210105561","display_name":"Institute for Management of Innovation and Technology","ror":"https://ror.org/01cnprv20","country_code":"SE","type":"facility","lineage":["https://openalex.org/I4210105561"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"E. Dubrova","raw_affiliation_strings":["Royal Institute of Technology, Stockholm, Sweden","IMIT/KTH, R. Inst. of Technol., Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"IMIT/KTH, R. Inst. of Technol., Stockholm, Sweden","institution_ids":["https://openalex.org/I4210105561"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011438358"],"corresponding_institution_ids":["https://openalex.org/I4210105561","https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.18483197,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"309","last_page":"314"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9983999729156494,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.8535434603691101},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6172841787338257},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49521365761756897},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48913338780403137},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4862707853317261},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4681810438632965},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4556063711643219},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4522866904735565},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.44650131464004517},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44090649485588074},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4369314908981323},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39948099851608276},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3983696699142456},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13348832726478577}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8535434603691101},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6172841787338257},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49521365761756897},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48913338780403137},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4862707853317261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4681810438632965},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4556063711643219},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4522866904735565},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.44650131464004517},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44090649485588074},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4369314908981323},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39948099851608276},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3983696699142456},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13348832726478577},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ismvl.2004.1319960","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ismvl.2004.1319960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 34th International Symposium on Multiple-Valued Logic","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320939","display_name":"Swedish Foundation for International Cooperation in Research and Higher Education","ror":"https://ror.org/0561xc723"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W606312175","https://openalex.org/W1487921619","https://openalex.org/W1572774147","https://openalex.org/W1598817068","https://openalex.org/W1622626486","https://openalex.org/W1772774228","https://openalex.org/W1839615380","https://openalex.org/W1976357819","https://openalex.org/W1985245264","https://openalex.org/W2003312024","https://openalex.org/W2008441811","https://openalex.org/W2018368463","https://openalex.org/W2020076393","https://openalex.org/W2049105156","https://openalex.org/W2092576944","https://openalex.org/W2093176534","https://openalex.org/W2110737535","https://openalex.org/W2111379929","https://openalex.org/W2116181020","https://openalex.org/W2116305334","https://openalex.org/W2122100106","https://openalex.org/W2124339980","https://openalex.org/W2133246738","https://openalex.org/W2137917061","https://openalex.org/W2138231715","https://openalex.org/W2148324414","https://openalex.org/W2149324173","https://openalex.org/W2156753779","https://openalex.org/W2158102622","https://openalex.org/W2169742923","https://openalex.org/W2259343571","https://openalex.org/W2323419649","https://openalex.org/W4237666325","https://openalex.org/W6618779508"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W47687724","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,15,28,39,61,66,118],"problem":[4,16,29],"of":[5,8,17,21,30,34,53,63,65,83,97,112,120],"non-disjoint":[6,19,81,98],"decomposition":[7],"multiple-valued":[9,23,84],"functions.":[10],"First,":[11],"we":[12,42],"show":[13],"that":[14],"computing":[18,49,93],"decompositions":[20,82,99],"a":[22,35,54,94,103],"function":[24],"is":[25,60,71,86],"related":[26],"to":[27],"finding":[31,78],"multiple-vertex":[32,51],"dominators":[33,52],"logic":[36,67],"circuit,":[37],"representing":[38],"function.":[40],"Second,":[41],"present":[43],"an":[44],"O(n/sup":[45],"k/)":[46],"algorithm":[47,76],"for":[48,77],"all":[50,79],"fixed":[55],"size":[56],"k,":[57],"where":[58],"n":[59],"number":[62],"gates":[64],"circuit.":[68],"Our":[69],"result":[70],"important":[72],"because":[73],"no":[74],"polynomial-time":[75],"possible":[80],"functions":[85],"known.":[87],"The":[88],"presented":[89],"approach":[90],"allows":[91],"us":[92],"certain":[95],"subset":[96],"(all":[100],"reflected":[101],"in":[102,107],"given":[104],"circuit":[105],"structure)":[106],"polynomial":[108],"time.":[109],"A":[110],"set":[111],"experiments":[113],"on":[114],"benchmark":[115],"circuits":[116],"illustrates":[117],"efficiency":[119],"our":[121],"approach.":[122]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}