{"id":"https://openalex.org/W4229510627","doi":"https://doi.org/10.1109/iccad.2005.1560032","title":"An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications","display_name":"An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications","publication_year":2005,"publication_date":"2005-12-22","ids":{"openalex":"https://openalex.org/W4229510627","doi":"https://doi.org/10.1109/iccad.2005.1560032"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2005.1560032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2005.1560032","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5002334825","display_name":"Paulo Flores","orcid":"https://orcid.org/0000-0003-2970-3589"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"P. Flores","raw_affiliation_strings":["IST/INESC, Lisboa, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST/INESC, Lisboa, Portugal","institution_ids":["https://openalex.org/I121345201"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039448613","display_name":"Jos\u00e9 Monteiro","orcid":"https://orcid.org/0000-0003-0603-2268"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"J. Monteiro","raw_affiliation_strings":["IST/INESC, Lisboa, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST/INESC, Lisboa, Portugal","institution_ids":["https://openalex.org/I121345201"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074598853","display_name":"Eduardo Costa","orcid":"https://orcid.org/0000-0003-0521-5898"},"institutions":[{"id":"https://openalex.org/I110676245","display_name":"Universidade Cat\u00f3lica de Pelotas","ror":"https://ror.org/0376myh60","country_code":"BR","type":"education","lineage":["https://openalex.org/I110676245"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"E. Costa","raw_affiliation_strings":["UCpel, Pelotas, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UCpel, Pelotas, Brazil","institution_ids":["https://openalex.org/I110676245"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"13","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11697","display_name":"Numerical Methods and Algorithms","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/T11435","display_name":"Polynomial and algebraic computation","score":0.9947999715805054,"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/constant","display_name":"Constant (computer programming)","score":0.6151025295257568},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5964489579200745},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5457635521888733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.545149028301239},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5267702341079712},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4764814078807831},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41954949498176575},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4109455943107605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3645981550216675},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32617777585983276},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31205320358276367},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.25461268424987793}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6151025295257568},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5964489579200745},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5457635521888733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.545149028301239},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5267702341079712},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4764814078807831},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41954949498176575},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4109455943107605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3645981550216675},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32617777585983276},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31205320358276367},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.25461268424987793},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2005.1560032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2005.1560032","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1528279629","https://openalex.org/W1530881390","https://openalex.org/W2107550869","https://openalex.org/W2117373759","https://openalex.org/W2119529071","https://openalex.org/W2164339744","https://openalex.org/W2165837912"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W2118943303","https://openalex.org/W2952805501","https://openalex.org/W1775352280","https://openalex.org/W2498042365","https://openalex.org/W1513854836","https://openalex.org/W2115480761"],"abstract_inverted_index":{"In":[0],"this":[1,23,52,110],"paper,":[2],"we":[3],"propose":[4],"an":[5,65,71,98],"exact":[6,147],"algorithm":[7],"that":[8,29,82,122,135,151,209],"maximizes":[9],"the":[10,41,46,58,84,103,106,123,129,146,156,159,163,185,198,210,213,223],"sharing":[11],"of":[12,43,57,132,158,165,212],"partial":[13,33,77,80],"terms":[14,34,81],"in":[15,45,105,190,222],"multiple":[16],"constant":[17],"multiplication":[18],"(MCM)":[19],"operations.":[20],"We":[21,108,149,169],"model":[22],"problem":[24,111,119,160],"as":[25],"a":[26,68,75,93,113,219],"Boolean":[27],"network":[28,53],"covers":[30],"all":[31,102],"possible":[32],"which":[35,96],"may":[36],"be":[37,182],"used":[38,143],"to":[39,51,137,144,204],"generate":[40],"set":[42],"coefficients":[44,104],"MCM":[47,59],"instance.":[48],"The":[49,206],"PIs":[50],"are":[54,88],"shifted":[55],"versions":[56],"input.":[60],"An":[61],"AND":[62,72,133],"gate":[63,73],"represents":[64],"adder":[66],"or":[67,201],"subtracter,":[69],"i.e.,":[70],"generates":[74],"new":[76],"term.":[78],"All":[79],"have":[83,218],"same":[85],"numerical":[86],"value":[87],"ORed":[89],"together.":[90],"There":[91],"is":[92,97,125,142,161,188,208],"single":[94],"output":[95,124],"/spl":[99],"and/":[100],"over":[101],"MCM.":[107],"cast":[109],"into":[112],"0-1":[114],"integer":[115],"linear":[116],"programming":[117],"(ILP)":[118],"by":[120],"requiring":[121],"asserted":[126],"while":[127],"minimizing":[128],"total":[130],"number":[131],"gates":[134],"evaluate":[136],"one.":[138],"A":[139],"SAT-based":[140],"solver":[141],"obtain":[145],"solution.":[148],"argue":[150],"for":[152],"many":[153,191],"real":[154],"problems":[155],"size":[157],"within":[162],"capabilities":[164],"current":[166],"SAT":[167],"solvers.":[168],"present":[170],"results":[171],"using":[172],"binary,":[173],"CSD":[174],"and":[175],"MSD":[176,214],"representations.":[177],"Two":[178],"main":[179],"conclusions":[180],"can":[181],"drawn":[183],"from":[184],"results.":[186],"One":[187],"that,":[189],"cases,":[192],"existing":[193],"heuristics":[194],"perform":[195],"well,":[196],"computing":[197],"best":[199],"solution,":[200],"one":[202],"close":[203],"it.":[205],"other":[207],"flexibility":[211],"representation":[215],"does":[216],"not":[217],"significant":[220],"impact":[221],"solution":[224],"obtained.":[225]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}