{"id":"https://openalex.org/W2013380636","doi":"https://doi.org/10.1007/s10623-012-9719-x","title":"Boolean autoencoders and hypercube clustering complexity","display_name":"Boolean autoencoders and hypercube clustering complexity","publication_year":2012,"publication_date":"2012-07-23","ids":{"openalex":"https://openalex.org/W2013380636","doi":"https://doi.org/10.1007/s10623-012-9719-x","mag":"2013380636"},"language":"en","primary_location":{"id":"doi:10.1007/s10623-012-9719-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10623-012-9719-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10623-012-9719-x.pdf","source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10623-012-9719-x.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088813478","display_name":"Pierre Baldi","orcid":"https://orcid.org/0000-0001-8752-4664"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"P. Baldi","raw_affiliation_strings":["Department of Computer Science, University of California, Irvine, CA, USA","Department of Computer Science, University of California, Irvine, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, USA#TAB#","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088813478"],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.3264,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.83345475,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"65","issue":"3","first_page":"383","last_page":"403"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9991000294685364,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9991000294685364,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.992900013923645,"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/T10320","display_name":"Neural Networks and Applications","score":0.9922000169754028,"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/autoencoder","display_name":"Autoencoder","score":0.7320347428321838},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.6713513135910034},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6261219382286072},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5863667130470276},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5451717376708984},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.5021517276763916},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5010571479797363},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4835679233074188},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.463814914226532},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.46008753776550293},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4262847304344177},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.4250369369983673},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37698590755462646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36107802391052246},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.3354286551475525},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2888001799583435},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2679871618747711}],"concepts":[{"id":"https://openalex.org/C101738243","wikidata":"https://www.wikidata.org/wiki/Q786435","display_name":"Autoencoder","level":3,"score":0.7320347428321838},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.6713513135910034},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6261219382286072},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5863667130470276},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5451717376708984},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.5021517276763916},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5010571479797363},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4835679233074188},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.463814914226532},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.46008753776550293},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4262847304344177},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.4250369369983673},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37698590755462646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36107802391052246},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.3354286551475525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2888001799583435},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2679871618747711},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10623-012-9719-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10623-012-9719-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10623-012-9719-x.pdf","source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.699.393","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.393","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.igb.uci.edu/%7Epfbaldi/download/download.inc.php?pid%3D299","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/s10623-012-9719-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10623-012-9719-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10623-012-9719-x.pdf","source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1714109445","display_name":null,"funder_award_id":"T15 LM07443","funder_id":"https://openalex.org/F4320332161","funder_display_name":"National Institutes of Health"},{"id":"https://openalex.org/G1953492143","display_name":null,"funder_award_id":"NIH LM010235","funder_id":"https://openalex.org/F4320332161","funder_display_name":"National Institutes of Health"},{"id":"https://openalex.org/G4651572499","display_name":null,"funder_award_id":"LM010235","funder_id":"https://openalex.org/F4320332161","funder_display_name":"National Institutes of Health"},{"id":"https://openalex.org/G6144905611","display_name":null,"funder_award_id":"IIS-0513376","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"},{"id":"https://openalex.org/F4320332161","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2013380636.pdf","grobid_xml":"https://content.openalex.org/works/W2013380636.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W183327403","https://openalex.org/W196871588","https://openalex.org/W1526741802","https://openalex.org/W1560724230","https://openalex.org/W1651818244","https://openalex.org/W1987342617","https://openalex.org/W2024269665","https://openalex.org/W2029952774","https://openalex.org/W2033272835","https://openalex.org/W2035929826","https://openalex.org/W2049633694","https://openalex.org/W2051311803","https://openalex.org/W2078580055","https://openalex.org/W2078626246","https://openalex.org/W2094656226","https://openalex.org/W2100495367","https://openalex.org/W2111319461","https://openalex.org/W2133962824","https://openalex.org/W2136922672","https://openalex.org/W2138857742","https://openalex.org/W2154642048","https://openalex.org/W2155315903","https://openalex.org/W2157665330","https://openalex.org/W2160039585","https://openalex.org/W2165232124","https://openalex.org/W2181347294","https://openalex.org/W2613634265","https://openalex.org/W2799061466","https://openalex.org/W3013757365","https://openalex.org/W4244494905","https://openalex.org/W4246767555"],"related_works":["https://openalex.org/W1991822629","https://openalex.org/W1568384982","https://openalex.org/W1496352327","https://openalex.org/W2149869214","https://openalex.org/W4231391991","https://openalex.org/W2011469629","https://openalex.org/W2615739385","https://openalex.org/W2995617542","https://openalex.org/W3141532631","https://openalex.org/W2131164334"],"abstract_inverted_index":{"We":[0,29,69],"introduce":[1],"and":[2,59,81,102],"study":[3],"the":[4,15,27,37,48,61,72,115,124,131],"properties":[5],"of":[6,50,154,163],"Boolean":[7,16,63,74,132],"autoencoder":[8,17,64,75,110],"circuits.":[9,104],"In":[10],"particular,":[11],"we":[12],"show":[13,30],"that":[14,31,71,109],"circuit":[18,76],"problem":[19,25,65,77],"is":[20,43,66,78,108,112],"equivalent":[21],"to":[22],"a":[23,119,151],"clustering":[24,32],"on":[26,36],"hypercube.":[28],"m":[33],"binary":[34],"vectors":[35],"n-dimensional":[38],"hypercube":[39],"into":[40],"k":[41],"clusters":[42,51],"NP-hard,":[44,80],"as":[45,47],"soon":[46],"number":[49],"scales":[52],"like":[53],"$${m^\\epsilon":[54],"(\\epsilon":[55],">0":[56],")}$$":[57],",":[58],"thus":[60],"general":[62,116],"also":[67,79],"NP-hard.":[68],"prove":[70],"linear":[73,94,125],"so":[82],"are":[83],"several":[84],"related":[85],"problems":[86],"such":[87],"as:":[88],"subspace":[89],"identification":[90],"over":[91,96,127],"finite":[92,97],"fields,":[93,98],"regression":[95],"even/odd":[99],"set":[100],"intersections,":[101],"parity":[103],"The":[105],"emerging":[106],"picture":[107],"optimization":[111],"NP-hard":[113],"in":[114],"case,":[117],"with":[118,134],"few":[120],"notable":[121],"exceptions":[122],"including":[123,147,160],"cases":[126],"infinite":[128],"fields":[129],"or":[130,166],"case":[133],"fixed":[135],"size":[136],"hidden":[137],"layer.":[138],"However":[139],"learning":[140,155],"can":[141],"be":[142],"tackled":[143],"by":[144],"approximate":[145],"algorithms,":[146],"alternate":[148],"optimization,":[149],"suggesting":[150],"new":[152],"class":[153],"algorithms":[156],"for":[157],"deep":[158,161],"networks,":[159],"networks":[162],"threshold":[164],"gates":[165],"artificial":[167],"neurons.":[168]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}