{"id":"https://openalex.org/W2039213367","doi":"https://doi.org/10.1137/s0895480190283595","title":"Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy","display_name":"Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy","publication_year":1995,"publication_date":"1995-11-01","ids":{"openalex":"https://openalex.org/W2039213367","doi":"https://doi.org/10.1137/s0895480190283595","mag":"2039213367"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480190283595","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480190283595","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/A5005870042","display_name":"Ilan Newman","orcid":"https://orcid.org/0000-0002-4845-4111"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ilan Newman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039043184","display_name":"Avi Wigderson","orcid":"https://orcid.org/0000-0002-1539-1417"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Avi Wigderson","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005870042"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5351,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.65412668,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"8","issue":"4","first_page":"536","last_page":"542"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9990000128746033,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9990000128746033,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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/hypergraph","display_name":"Hypergraph","score":0.8484684228897095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8281154632568359},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.653624951839447},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.5729215741157532},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5669839382171631},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5627318024635315},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5374314188957214},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.48783090710639954},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4502682685852051},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4182153642177582},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2042347490787506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08467334508895874}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8484684228897095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8281154632568359},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.653624951839447},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.5729215741157532},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5669839382171631},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5627318024635315},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5374314188957214},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.48783090710639954},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4502682685852051},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4182153642177582},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2042347490787506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08467334508895874},{"id":"https://openalex.org/C7608002","wikidata":"https://www.wikidata.org/wiki/Q477202","display_name":"Cryptographic hash function","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0895480190283595","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480190283595","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.7079","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.7079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.haifa.ac.il/ILAN/thresh.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.5880","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.5880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.huji.ac.il/~avi/NW.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.84.5590","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.5590","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/HNW96/entropy.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W175482385","https://openalex.org/W1517585663","https://openalex.org/W1549664537","https://openalex.org/W1594002898","https://openalex.org/W1972949703","https://openalex.org/W1977452695","https://openalex.org/W1996172330","https://openalex.org/W2029773437","https://openalex.org/W2045394325","https://openalex.org/W2053816258","https://openalex.org/W2056884477","https://openalex.org/W2092016058","https://openalex.org/W2128085757","https://openalex.org/W3090398476","https://openalex.org/W3110528727","https://openalex.org/W4206794571"],"related_works":["https://openalex.org/W2097286495","https://openalex.org/W2080388000","https://openalex.org/W2065331859","https://openalex.org/W2155123971","https://openalex.org/W1897694601","https://openalex.org/W3212703233","https://openalex.org/W1845395494","https://openalex.org/W62638829","https://openalex.org/W2083620925","https://openalex.org/W1551533237"],"abstract_inverted_index":{"K\u00f6rner":[0],"defined":[1],"the":[2,12,15,20,52],"notion":[3,31],"of":[4,14,23],"graph":[5],"entropy.":[6],"He":[7],"used":[8],"it":[9],"to":[10,32,47],"simplify":[11],"proof":[13],"Fredman\u2013Komlos":[16],"lower":[17,40],"bound":[18],"for":[19,37,50],"family":[21],"size":[22,39],"perfect":[24],"hash":[25],"functions.":[26],"We":[27],"use":[28],"this":[29],"information-theoretic":[30],"obtain":[33],"a":[34],"general":[35,55],"method":[36,43],"formula":[38],"bounds.":[41],"This":[42],"can":[44],"be":[45],"applied":[46],"low-complexity":[48],"functions":[49],"which":[51],"other":[53],"known":[54],"methods":[56],"do":[57],"not":[58],"apply.":[59]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
