{"id":"https://openalex.org/W2159953367","doi":"https://doi.org/10.1007/pl00009265","title":"Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions","display_name":"Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions","publication_year":1999,"publication_date":"1999-04-01","ids":{"openalex":"https://openalex.org/W2159953367","doi":"https://doi.org/10.1007/pl00009265","mag":"2159953367"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009265","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009265","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5052560792","display_name":"Vince Grolmusz","orcid":"https://orcid.org/0000-0001-9456-8876"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"V. Grolmusz","raw_affiliation_strings":["Department of Computer Science,  E\u00f6tv\u00f6s University, M\u00fazeum krt.6-8, H-1088 Budapest, Hungary.   grolmusz@cs.elte.hu., , , , , , HU","Department of Computer Science,  E\u00f6tv\u00f6s University, M\u00fazeum krt.6-8, H-1088 Budapest, Hungary.   grolmusz@cs.elte.hu., , HU"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  E\u00f6tv\u00f6s University, M\u00fazeum krt.6-8, H-1088 Budapest, Hungary.   grolmusz@cs.elte.hu., , , , , , HU","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"Department of Computer Science,  E\u00f6tv\u00f6s University, M\u00fazeum krt.6-8, H-1088 Budapest, Hungary.   grolmusz@cs.elte.hu., , HU","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052560792"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.4871,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.69045381,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"23","issue":"4","first_page":"341","last_page":"353"},"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.9998999834060669,"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.9998999834060669,"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/T10237","display_name":"Cryptography and Data Security","score":0.9983999729156494,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.998199999332428,"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/communication-complexity","display_name":"Communication complexity","score":0.7803937196731567},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7413186430931091},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6328890323638916},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6208407282829285},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6191479563713074},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6182835698127747},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5854638814926147},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.543201208114624},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5385675430297852},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.5336787104606628},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.506974458694458},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5016524791717529},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4844682216644287},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4477326571941376},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4279382824897766},{"id":"https://openalex.org/keywords/complexity-index","display_name":"Complexity index","score":0.4267153739929199},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.42099660634994507},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3758606016635895},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.17012110352516174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1127324104309082}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7803937196731567},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7413186430931091},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6328890323638916},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6208407282829285},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6191479563713074},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6182835698127747},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5854638814926147},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.543201208114624},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5385675430297852},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.5336787104606628},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.506974458694458},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5016524791717529},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4844682216644287},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4477326571941376},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4279382824897766},{"id":"https://openalex.org/C6435147","wikidata":"https://www.wikidata.org/wiki/Q5156627","display_name":"Complexity index","level":3,"score":0.4267153739929199},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.42099660634994507},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3758606016635895},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.17012110352516174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1127324104309082},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/pl00009265","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009265","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W46930346","https://openalex.org/W751324071","https://openalex.org/W1551614270","https://openalex.org/W1970746682","https://openalex.org/W1990538552","https://openalex.org/W2033884447","https://openalex.org/W2041210515","https://openalex.org/W2042194938","https://openalex.org/W2070678975","https://openalex.org/W2074564146","https://openalex.org/W2078561064","https://openalex.org/W2103749128","https://openalex.org/W2117508909","https://openalex.org/W2140469501","https://openalex.org/W2147154704"],"related_works":["https://openalex.org/W2120210041","https://openalex.org/W2101069215","https://openalex.org/W2082224527","https://openalex.org/W2963903795","https://openalex.org/W2950910290","https://openalex.org/W2008470896","https://openalex.org/W4298273595","https://openalex.org/W2075106440","https://openalex.org/W2078940883","https://openalex.org/W2159953367"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}