{"id":"https://openalex.org/W2045008295","doi":"https://doi.org/10.1137/050632026","title":"On <i>k</i>-Term DNF with the Largest Number of Prime Implicants","display_name":"On <i>k</i>-Term DNF with the Largest Number of Prime Implicants","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2045008295","doi":"https://doi.org/10.1137/050632026","mag":"2045008295"},"language":"en","primary_location":{"id":"doi:10.1137/050632026","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050632026","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5078127997","display_name":"Robert H. Sloan","orcid":null},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert H. Sloan","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Chicago,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Chicago,#TAB#","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048258912","display_name":"Bal\u00e1zs Sz\u00f6r\u00e9nyi","orcid":null},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Bal\u00e1zs Sz\u00f6r\u00e9nyi","raw_affiliation_strings":["University of Szeged"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Szeged","institution_ids":["https://openalex.org/I227486990"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109457644","display_name":"Gy\u00f6rgy Tur\u00e1n","orcid":null},"institutions":[{"id":"https://openalex.org/I4210089577","display_name":"Gender Studies","ror":"https://ror.org/00at2pp81","country_code":"CZ","type":"nonprofit","lineage":["https://openalex.org/I4210089577"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Gy\u00f6rgy Tur\u00e1n","raw_affiliation_strings":["Ctr for Rsch on Women & Gender"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ctr for Rsch on Women & Gender","institution_ids":["https://openalex.org/I4210089577"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2419,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.804172,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"21","issue":"4","first_page":"987","last_page":"998"},"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.9970999956130981,"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.9970999956130981,"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.9968000054359436,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.949415385723114},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.7625874280929565},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.722718358039856},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.6679176688194275},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6609039306640625},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4648192524909973},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41277819871902466},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.2745874524116516}],"concepts":[{"id":"https://openalex.org/C102487863","wikidata":"https://www.wikidata.org/wiki/Q1291626","display_name":"Implicant","level":4,"score":0.949415385723114},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.7625874280929565},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.722718358039856},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.6679176688194275},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6609039306640625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4648192524909973},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41277819871902466},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.2745874524116516},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/050632026","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050632026","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6200000047683716,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G7078210065","display_name":"Complexity Aspects of  Knowledge Representation and Learning","funder_award_id":"0431059","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1516313231","https://openalex.org/W1517585663","https://openalex.org/W1525293204","https://openalex.org/W1559680689","https://openalex.org/W1564514837","https://openalex.org/W1860888886","https://openalex.org/W1940223960","https://openalex.org/W1957114827","https://openalex.org/W1977881907","https://openalex.org/W2000171675","https://openalex.org/W2001002030","https://openalex.org/W2003979824","https://openalex.org/W2015211698","https://openalex.org/W2019184769","https://openalex.org/W2035332232","https://openalex.org/W2037611290","https://openalex.org/W2039214864","https://openalex.org/W2044983583","https://openalex.org/W2045502027","https://openalex.org/W2050166670","https://openalex.org/W2103749128","https://openalex.org/W2140361351","https://openalex.org/W2140395855","https://openalex.org/W2785506964"],"related_works":["https://openalex.org/W1978042415","https://openalex.org/W3086542228","https://openalex.org/W2184427155","https://openalex.org/W2017331178","https://openalex.org/W2976797620","https://openalex.org/W2185671459","https://openalex.org/W2404664685","https://openalex.org/W2355764787","https://openalex.org/W1985698120","https://openalex.org/W4303684388"],"abstract_inverted_index":{"It":[0,34],"is":[1,20,35,40],"known":[2],"that":[3,17,37],"a":[4,38,49,60],"k-term":[5,25],"DNF":[6,26,39],"can":[7],"have":[8],"at":[9],"most":[10],"$2^k":[11],"-":[12],"1$":[13],"prime":[14,32],"implicants":[15],"and":[16,43,69],"this":[18],"bound":[19],"sharp.":[21],"We":[22,63],"determine":[23],"all":[24],"having":[27],"the":[28,57],"maximal":[29,41],"number":[30],"of":[31],"implicants.":[33],"shown":[36],"if":[42,45],"only":[44],"it":[46],"corresponds":[47],"to":[48,56],"nonrepeating":[50],"decision":[51],"tree":[52],"with":[53],"literals":[54],"assigned":[55],"leaves":[58],"in":[59],"certain":[61],"way.":[62],"also":[64],"mention":[65],"some":[66],"related":[67],"results":[68],"open":[70],"problems.":[71]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}