{"id":"https://openalex.org/W2038321016","doi":"https://doi.org/10.1016/0167-9260(91)90052-m","title":"A logic minimization algorithm of functions with large DC-set","display_name":"A logic minimization algorithm of functions with large DC-set","publication_year":1991,"publication_date":"1991-06-01","ids":{"openalex":"https://openalex.org/W2038321016","doi":"https://doi.org/10.1016/0167-9260(91)90052-m","mag":"2038321016"},"language":"en","primary_location":{"id":"doi:10.1016/0167-9260(91)90052-m","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-9260(91)90052-m","pdf_url":null,"source":{"id":"https://openalex.org/S139392130","display_name":"Integration","issn_l":"0167-9260","issn":["0167-9260","1872-7522"],"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":"Integration","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/A5062322757","display_name":"N.Q. Thang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210118827","display_name":"Institute of Electron Technology","ror":"https://ror.org/02khfkr46","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210118827"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"N.Q. Thang","raw_affiliation_strings":["Institute of Electron Technology, Al. Lotnikow 32/46, 02-668 Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Electron Technology, Al. Lotnikow 32/46, 02-668 Warsaw, Poland","institution_ids":["https://openalex.org/I4210118827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062322757"],"corresponding_institution_ids":["https://openalex.org/I4210118827"],"apc_list":{"value":2150,"currency":"USD","value_usd":2150},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17233473,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"3","first_page":"317","last_page":"327"},"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.9962999820709229,"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.9962999820709229,"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/T11567","display_name":"semigroups and automata theory","score":0.9934999942779541,"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/T11269","display_name":"Algorithms and Data Compression","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/implicant","display_name":"Implicant","score":0.8607525825500488},{"id":"https://openalex.org/keywords/tautology","display_name":"Tautology (logic)","score":0.8098278045654297},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6201391816139221},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6055407524108887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.585041880607605},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5199393033981323},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.46572253108024597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4551028311252594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4117392599582672},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4009312391281128},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3663293719291687},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3349689841270447},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.3201814293861389},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20843243598937988},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10207393765449524},{"id":"https://openalex.org/keywords/zeroth-order-logic","display_name":"Zeroth-order logic","score":0.0902814269065857},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.06950649619102478}],"concepts":[{"id":"https://openalex.org/C102487863","wikidata":"https://www.wikidata.org/wiki/Q1291626","display_name":"Implicant","level":4,"score":0.8607525825500488},{"id":"https://openalex.org/C166374712","wikidata":"https://www.wikidata.org/wiki/Q209555","display_name":"Tautology (logic)","level":5,"score":0.8098278045654297},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6201391816139221},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6055407524108887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.585041880607605},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5199393033981323},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.46572253108024597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4551028311252594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4117392599582672},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4009312391281128},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3663293719291687},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3349689841270447},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.3201814293861389},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20843243598937988},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10207393765449524},{"id":"https://openalex.org/C110039528","wikidata":"https://www.wikidata.org/wiki/Q8069651","display_name":"Zeroth-order logic","level":4,"score":0.0902814269065857},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.06950649619102478},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0167-9260(91)90052-m","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-9260(91)90052-m","pdf_url":null,"source":{"id":"https://openalex.org/S139392130","display_name":"Integration","issn_l":"0167-9260","issn":["0167-9260","1872-7522"],"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":"Integration","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338111","display_name":"Precursory Research for Embryonic Science and Technology","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2011461607","https://openalex.org/W2026823405","https://openalex.org/W2098878557","https://openalex.org/W2105761964","https://openalex.org/W2124078793","https://openalex.org/W2125905231","https://openalex.org/W6653576183","https://openalex.org/W6657040788","https://openalex.org/W6675154618","https://openalex.org/W6986323187"],"related_works":["https://openalex.org/W2046603834","https://openalex.org/W2045202376","https://openalex.org/W1972326543","https://openalex.org/W2045381241","https://openalex.org/W1999154139","https://openalex.org/W2038321016","https://openalex.org/W1979258071","https://openalex.org/W2142356657","https://openalex.org/W1557763969","https://openalex.org/W2031298013"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}