{"id":"https://openalex.org/W7100110689","doi":null,"title":"ANALYSIS OF MINIMIZATION ALGORITHMS FOR MULTIPLEVALUED PROGRAMMABLE LOGIC ARRAYS*","display_name":"ANALYSIS OF MINIMIZATION ALGORITHMS FOR MULTIPLEVALUED PROGRAMMABLE LOGIC ARRAYS*","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7100110689"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.907.7071","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.907.7071","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://calhoun.nps.edu/bitstream/handle/10945/35767/Tir_But_ISMVL1988.pdf%3Bjsessionid%3DB649304F7CD59B0242854AC2B0C6A652?sequence%3D3","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7100110689"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Tirumalai Parthasarathy","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tirumalai Parthasarathy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Parthasarathy Tirumalai","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Parthasarathy Tirumalai","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9692000150680542,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9692000150680542,"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"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.00570000009611249,"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"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.0032999999821186066,"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/logic-minimization","display_name":"logic minimization","score":0.859000027179718}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8497999906539917},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.7411999702453613},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6589000225067139},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6452000141143799},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5361999869346619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5220999717712402},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.49720001220703125},{"id":"https://openalex.org/C206274596","wikidata":"https://www.wikidata.org/wiki/Q1063837","display_name":"Programmable logic device","level":2,"score":0.45969998836517334},{"id":"https://openalex.org/C105285975","wikidata":"https://www.wikidata.org/wiki/Q2719417","display_name":"Canonical normal form","level":2,"score":0.45100000500679016},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.4336000084877014},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.40560001134872437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3939000070095062},{"id":"https://openalex.org/C182322920","wikidata":"https://www.wikidata.org/wiki/Q2112217","display_name":"Programmable logic array","level":3,"score":0.37689998745918274},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.3384999930858612},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.321399986743927},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.28290000557899475},{"id":"https://openalex.org/C62360110","wikidata":"https://www.wikidata.org/wiki/Q96777007","display_name":"Circumscription","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.25760000944137573}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.907.7071","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.907.7071","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://calhoun.nps.edu/bitstream/handle/10945/35767/Tir_But_ISMVL1988.pdf%3Bjsessionid%3DB649304F7CD59B0242854AC2B0C6A652?sequence%3D3","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"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/W7096478902","https://openalex.org/W2155813482","https://openalex.org/W127573552","https://openalex.org/W2014500391","https://openalex.org/W1528278469","https://openalex.org/W2115652678","https://openalex.org/W249380094","https://openalex.org/W7095397543","https://openalex.org/W1993937043","https://openalex.org/W2165132873"],"abstract_inverted_index":{"We":[0,39,56],"compare":[1,40],"the":[2,10,17,41,44,63,81,89,99,104,121],"performance":[3],"of":[4,12,61,66,72,85,101],"three":[5,77],"heuris-tic":[6],"algorithms":[7],"[3,6,13]":[8],"for":[9],"minimization":[11,31],"sum-of-products":[13],"expressions":[14],"realized":[15],"by":[16],"newly":[18],"developed":[19],"multiplevalued":[20],"programmable":[21],"logic":[22],"arrays":[23],"[9].":[24],"Heuristic":[25],"methods":[26,50],"are":[27,51,91],"important":[28],"because":[29],"exact":[30,45],"is":[32,94,107,111],"extremely":[33],"t":[34],"i":[35],"m":[36],"e":[37],"consuming.":[38],"heuristics":[42,78,117],"to":[43,54,114],"solution,":[46],"showing":[47],"that":[48],"heuristic":[49],"reasonably":[52],"close":[53],"minimal.":[55],"use":[57],"as":[58],"a":[59,70,112],"basis":[60],"comparison":[62],"average":[64,83],"number":[65,84],"pro-duct":[67],"terms":[68],"over":[69],"set":[71,100],"randomly":[73],"generated":[74],"functions.":[75],"All":[76],"produce":[79],"nearly":[80],"same":[82],"product":[86],"terms.":[87],"Although":[88],"averages":[90],"close,":[92],"there":[93,110],"surpris-ingly":[95],"little":[96],"overlap":[97],"among":[98],"functions":[102],"where":[103],"best":[105,122],"realization":[106],"achieved.":[108],"Thus,":[109],"benefit":[113],"applying":[115],"different":[116],"and":[118],"then":[119],"choosing":[120],"realization.":[123],"I.":[124]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7100110689","counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}
