{"id":"https://openalex.org/W258677105","doi":"https://doi.org/10.1016/s0304-3975(96)00217-4","title":"Optimal bounds for the approximation of boolean functions and some applications","display_name":"Optimal bounds for the approximation of boolean functions and some applications","publication_year":1997,"publication_date":"1997-06-01","ids":{"openalex":"https://openalex.org/W258677105","doi":"https://doi.org/10.1016/s0304-3975(96)00217-4","mag":"258677105"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(96)00217-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(96)00217-4","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5110054740","display_name":"Alexander E. Andreev","orcid":null},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Alexander E. Andreev","raw_affiliation_strings":["Department of Mathematics and Mechanics, University of Moscow, 119899 Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Mechanics, University of Moscow, 119899 Moscow, Russia","institution_ids":["https://openalex.org/I19880235"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001082357","display_name":"Andrea Clementi","orcid":"https://orcid.org/0000-0002-9521-2457"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]},{"id":"https://openalex.org/I4210101866","display_name":"Informa (Italy)","ror":"https://ror.org/017c2y429","country_code":"IT","type":"company","lineage":["https://openalex.org/I4210101866","https://openalex.org/I4210154378"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Andrea E.F. Clementi","raw_affiliation_strings":["Dip. di Scienze dell'Informazione, University of Rome, La Sapienza, Italy"],"affiliations":[{"raw_affiliation_string":"Dip. di Scienze dell'Informazione, University of Rome, La Sapienza, Italy","institution_ids":["https://openalex.org/I861853513","https://openalex.org/I4210101866"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045128977","display_name":"Andrea Roli","orcid":"https://orcid.org/0000-0001-9891-5441"},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Jos\u00e9D.P. Rolim","raw_affiliation_strings":["Centre Universitaire d'Informatique, University of Geneva, 24 Rue General Dufur, CH 1211 Geneve, Switzerland"],"affiliations":[{"raw_affiliation_string":"Centre Universitaire d'Informatique, University of Geneva, 24 Rue General Dufur, CH 1211 Geneve, Switzerland","institution_ids":["https://openalex.org/I114457229"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110054740"],"corresponding_institution_ids":["https://openalex.org/I19880235"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03083135,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"180","issue":"1-2","first_page":"243","last_page":"268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9936000108718872,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9936000108718872,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9760000109672546,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9740999937057495,"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/boolean-function","display_name":"Boolean function","score":0.8423134088516235},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6990660429000854},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6401005983352661},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.6252139806747437},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.616089403629303},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6025063395500183},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5833150744438171},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5267000794410706},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.474893718957901},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.46987253427505493},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.4648859202861786},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.4434342384338379},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.4341932535171509},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.42894643545150757},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06090858578681946}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.8423134088516235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6990660429000854},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6401005983352661},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.6252139806747437},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.616089403629303},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6025063395500183},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5833150744438171},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5267000794410706},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.474893718957901},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.46987253427505493},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.4648859202861786},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.4434342384338379},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.4341932535171509},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.42894643545150757},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06090858578681946},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(96)00217-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(96)00217-4","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"mag:258677105","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc2.html#ECCC-TR95-041","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1989430020","https://openalex.org/W2029961404","https://openalex.org/W2042587503","https://openalex.org/W2057399436","https://openalex.org/W2068422506","https://openalex.org/W2146969125","https://openalex.org/W2164284862","https://openalex.org/W2166674827","https://openalex.org/W4301434805","https://openalex.org/W6646329910","https://openalex.org/W6653158451","https://openalex.org/W6657951591","https://openalex.org/W6678257095","https://openalex.org/W6697151237","https://openalex.org/W6742387898"],"related_works":["https://openalex.org/W2077610385","https://openalex.org/W2002337670","https://openalex.org/W2064329818","https://openalex.org/W1991921929","https://openalex.org/W2139991023","https://openalex.org/W2752113279","https://openalex.org/W1904076199","https://openalex.org/W2084152790","https://openalex.org/W2014377018","https://openalex.org/W171266665","https://openalex.org/W2942073256","https://openalex.org/W2140202836","https://openalex.org/W3025899895","https://openalex.org/W1492702334","https://openalex.org/W1564713837","https://openalex.org/W2912052665","https://openalex.org/W2950769787","https://openalex.org/W128724489","https://openalex.org/W1569494417","https://openalex.org/W267972510"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}