{"id":"https://openalex.org/W4387971932","doi":"https://doi.org/10.3390/a16110499","title":"Discovering Non-Linear Boolean Functions by Evolving Walsh Transforms with Genetic Programming","display_name":"Discovering Non-Linear Boolean Functions by Evolving Walsh Transforms with Genetic Programming","publication_year":2023,"publication_date":"2023-10-27","ids":{"openalex":"https://openalex.org/W4387971932","doi":"https://doi.org/10.3390/a16110499"},"language":"en","primary_location":{"id":"doi:10.3390/a16110499","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16110499","pdf_url":"https://www.mdpi.com/1999-4893/16/11/499/pdf?version=1698394045","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/16/11/499/pdf?version=1698394045","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067201044","display_name":"Luigi Rovito","orcid":"https://orcid.org/0000-0003-2772-4095"},"institutions":[{"id":"https://openalex.org/I142444530","display_name":"University of Trieste","ror":"https://ror.org/02n742c10","country_code":"IT","type":"education","lineage":["https://openalex.org/I142444530"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Luigi Rovito","raw_affiliation_strings":["Department of Engineering and Architecture, University of Trieste, 34127 Trieste, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Engineering and Architecture, University of Trieste, 34127 Trieste, Italy","institution_ids":["https://openalex.org/I142444530"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031604878","display_name":"Andrea De Lorenzo","orcid":"https://orcid.org/0000-0002-7628-7672"},"institutions":[{"id":"https://openalex.org/I142444530","display_name":"University of Trieste","ror":"https://ror.org/02n742c10","country_code":"IT","type":"education","lineage":["https://openalex.org/I142444530"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Andrea De Lorenzo","raw_affiliation_strings":["Department of Engineering and Architecture, University of Trieste, 34127 Trieste, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Engineering and Architecture, University of Trieste, 34127 Trieste, Italy","institution_ids":["https://openalex.org/I142444530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064452080","display_name":"Luca Manzoni","orcid":"https://orcid.org/0000-0001-6312-7728"},"institutions":[{"id":"https://openalex.org/I142444530","display_name":"University of Trieste","ror":"https://ror.org/02n742c10","country_code":"IT","type":"education","lineage":["https://openalex.org/I142444530"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca Manzoni","raw_affiliation_strings":["Department of Engineering and Architecture, University of Trieste, 34127 Trieste, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Engineering and Architecture, University of Trieste, 34127 Trieste, Italy","institution_ids":["https://openalex.org/I142444530"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067201044"],"corresponding_institution_ids":["https://openalex.org/I142444530"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.3554,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67050164,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"16","issue":"11","first_page":"499","last_page":"499"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9934999942779541,"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"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9934999942779541,"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/T12029","display_name":"DNA and Biological Computing","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9926000237464905,"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/boolean-function","display_name":"Boolean function","score":0.8177236318588257},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.7167282700538635},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.6150851249694824},{"id":"https://openalex.org/keywords/walsh-function","display_name":"Walsh function","score":0.529544472694397},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.510426938533783},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.50409996509552},{"id":"https://openalex.org/keywords/truth-table","display_name":"Truth table","score":0.4934317171573639},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4718962609767914},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43341630697250366},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4312828779220581},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.4285937547683716},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.4176754951477051},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.415641725063324},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12214618921279907}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.8177236318588257},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.7167282700538635},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.6150851249694824},{"id":"https://openalex.org/C164319782","wikidata":"https://www.wikidata.org/wiki/Q1934233","display_name":"Walsh function","level":2,"score":0.529544472694397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.510426938533783},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.50409996509552},{"id":"https://openalex.org/C56949724","wikidata":"https://www.wikidata.org/wiki/Q219079","display_name":"Truth table","level":2,"score":0.4934317171573639},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4718962609767914},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43341630697250366},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4312828779220581},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.4285937547683716},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.4176754951477051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.415641725063324},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12214618921279907}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a16110499","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16110499","pdf_url":"https://www.mdpi.com/1999-4893/16/11/499/pdf?version=1698394045","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:arts.units.it:11368/3062198","is_oa":true,"landing_page_url":"https://www.mdpi.com/1999-4893/16/11/499/html#B38-algorithms-16-00499","pdf_url":"https://www.mdpi.com/1999-4893/16/11/499/pdf","source":{"id":"https://openalex.org/S4306400480","display_name":"ArTS Archivio della ricerca di Trieste (University of Trieste https://www.units.it/)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142444530","host_organization_name":"University of Trieste","host_organization_lineage":["https://openalex.org/I142444530"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:e02e152e82f84ede8af8b25e32322877","is_oa":true,"landing_page_url":"https://doaj.org/article/e02e152e82f84ede8af8b25e32322877","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 16, Iss 11, p 499 (2023)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a16110499","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16110499","pdf_url":"https://www.mdpi.com/1999-4893/16/11/499/pdf?version=1698394045","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4387971932.pdf"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W102100901","https://openalex.org/W140633939","https://openalex.org/W166093442","https://openalex.org/W579428358","https://openalex.org/W1480457443","https://openalex.org/W1565533255","https://openalex.org/W1582278613","https://openalex.org/W1857789879","https://openalex.org/W1981357736","https://openalex.org/W1997102776","https://openalex.org/W2002308230","https://openalex.org/W2013276354","https://openalex.org/W2024060531","https://openalex.org/W2040492000","https://openalex.org/W2047903819","https://openalex.org/W2070687394","https://openalex.org/W2070729000","https://openalex.org/W2090432705","https://openalex.org/W2095563835","https://openalex.org/W2107899693","https://openalex.org/W2109394932","https://openalex.org/W2114510843","https://openalex.org/W2131617475","https://openalex.org/W2138828038","https://openalex.org/W2142114659","https://openalex.org/W2148542302","https://openalex.org/W2157812200","https://openalex.org/W2230451675","https://openalex.org/W2274349130","https://openalex.org/W2293055178","https://openalex.org/W2499930225","https://openalex.org/W2504274129","https://openalex.org/W2735385767","https://openalex.org/W2736080026","https://openalex.org/W2911452795","https://openalex.org/W2935945920","https://openalex.org/W2936354896","https://openalex.org/W3020944523","https://openalex.org/W3021613070","https://openalex.org/W3087150201","https://openalex.org/W3120067464","https://openalex.org/W3173152432","https://openalex.org/W4205482204","https://openalex.org/W4236140721","https://openalex.org/W4256739667","https://openalex.org/W4288044863","https://openalex.org/W4294812064","https://openalex.org/W4385209857","https://openalex.org/W6606806886","https://openalex.org/W6649518391"],"related_works":["https://openalex.org/W4231391991","https://openalex.org/W1534775143","https://openalex.org/W4252281389","https://openalex.org/W773614363","https://openalex.org/W1997660011","https://openalex.org/W2996462315","https://openalex.org/W2883069340","https://openalex.org/W2784358381","https://openalex.org/W2154303016","https://openalex.org/W4289743389"],"abstract_inverted_index":{"Stream":[0],"ciphers":[1],"usually":[2],"rely":[3],"on":[4],"highly":[5,210],"secure":[6,18],"Boolean":[7,19,52,99,187],"functions":[8,20,53,88,188,212],"to":[9,94,131,135,175,191,202,209],"ensure":[10],"safe":[11],"communication":[12],"within":[13],"unsafe":[14],"channels.":[15],"However,":[16],"discovering":[17],"is":[21,129,140],"a":[22,106,109,125,137],"non-trivial":[23],"optimization":[24,32],"problem":[25],"that":[26,122,139,204,213],"has":[27],"been":[28],"addressed":[29],"by":[30,36,57,81,123,148],"many":[31],"techniques:":[33],"in":[34,41,115],"particular":[35],"evolutionary":[37],"algorithms.":[38],"We":[39,120,145,167,185],"investigate":[40],"this":[42,183],"article":[43],"the":[44,59,74,96,116,156,162,170,177,196],"employment":[45],"of":[46,63,76,112,152,164,172,180],"Genetic":[47],"Programming":[48],"(GP)":[49],"for":[50,155,182],"evolving":[51,205],"with":[54,199],"large":[55],"non-linearity":[56],"examining":[58],"search":[60,201],"space":[61],"consisting":[62],"Walsh":[64,70,77,157,206],"transforms.":[65],"Especially,":[66],"we":[67,85,91,160],"build":[68,86],"generic":[69],"spectra":[71],"starting":[72],"from":[73,89,189],"evolution":[75,198],"transform":[78],"coefficients.":[79],"Then,":[80],"leveraging":[82],"spectral":[83],"inversion,":[84],"pseudo-Boolean":[87],"which":[90],"are":[92,214],"able":[93],"determine":[95],"corresponding":[97],"nearest":[98],"functions,":[100],"whose":[101],"computation":[102],"involves":[103],"filling":[104],"via":[105],"random":[107,200],"criterion":[108],"certain":[110],"amount":[111],"\u201cuncertain\u201d":[113],"positions":[114,134],"final":[117],"truth":[118],"table.":[119],"show":[121,203],"using":[124],"balancedness-preserving":[126],"strategy,":[127],"it":[128],"possible":[130],"exploit":[132],"those":[133],"obtain":[136],"function":[138],"as":[141,143,216],"balanced":[142,215],"possible.":[144],"perform":[146],"experiments":[147],"comparing":[149],"different":[150],"types":[151],"symbolic":[153],"representations":[154],"transform,":[158],"and":[159,194],"analyze":[161],"percentage":[163],"uncertain":[165],"positions.":[166],"systematically":[168],"review":[169],"outcomes":[171],"these":[173],"comparisons":[174],"highlight":[176],"best":[178],"type":[179],"setting":[181],"problem.":[184],"evolve":[186],"6":[190],"16":[192],"bits":[193],"compare":[195],"GP-based":[197],"transforms":[207],"leads":[208],"non-linear":[211],"well.":[217]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}