{"id":"https://openalex.org/W2027831741","doi":"https://doi.org/10.1109/sfcs.1992.267766","title":"Amplification and percolation (probabilistic Boolean functions)","display_name":"Amplification and percolation (probabilistic Boolean functions)","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2027831741","doi":"https://doi.org/10.1109/sfcs.1992.267766","mag":"2027831741"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.1992.267766","doi":"https://doi.org/10.1109/sfcs.1992.267766","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1992.267766","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings., 33rd Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5025030304","display_name":"Moshe Dubiner","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"M. Dubiner","raw_affiliation_strings":["Department of Applied Math, Tel-Aviv University, Tel-Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Math, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710","observed_orcids":["https://orcid.org/0000-0002-7638-7710"]},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"U. Zwick","raw_affiliation_strings":["Department of Computer Science, Tel-Aviv University, Tel-Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.3288,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.52571927,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"258","last_page":"267"},"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.9854000210762024,"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.9854000210762024,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.004100000020116568,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.0019000000320374966,"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/amplification","display_name":"amplification","score":0.5730000138282776},{"id":"https://openalex.org/keywords/percolation","display_name":"percolation","score":0.9340000152587891},{"id":"https://openalex.org/keywords/circuit-lower-bounds","display_name":"circuit lower bounds","score":0.75},{"id":"https://openalex.org/keywords/xor-gate","display_name":"XOR gate","score":0.7620000243186951}],"concepts":[{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7029078006744385},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6883305311203003},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6714560389518738},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5542014241218567},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5274446606636047},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4982566833496094},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4735873341560364},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.4664885997772217},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46425893902778625},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.15331056714057922},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10791343450546265},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.1992.267766","doi":"https://doi.org/10.1109/sfcs.1992.267766","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1992.267766","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings., 33rd Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W619004858","https://openalex.org/W1877427146","https://openalex.org/W1984108045","https://openalex.org/W1994942503","https://openalex.org/W2008470071","https://openalex.org/W2014091871","https://openalex.org/W2039077327","https://openalex.org/W2062767125","https://openalex.org/W2069919161","https://openalex.org/W2082003776","https://openalex.org/W2107341469","https://openalex.org/W2139906253","https://openalex.org/W2157938746","https://openalex.org/W2296084214","https://openalex.org/W4252929054","https://openalex.org/W4255982026","https://openalex.org/W4302344174"],"related_works":["https://openalex.org/W3214148052","https://openalex.org/W2151692181","https://openalex.org/W2515443718","https://openalex.org/W238609530","https://openalex.org/W794462722","https://openalex.org/W2029625042","https://openalex.org/W4248476017","https://openalex.org/W2807741550","https://openalex.org/W1525319740","https://openalex.org/W4247864646"],"abstract_inverted_index":{"The":[0],"authors":[1],"extend":[2],"R.B.":[3],"Boppana's":[4,78],"results":[5],"(1989)":[6],"in":[7],"two":[8,15,39],"ways.":[9],"They":[10,32],"first":[11],"show":[12,44],"that":[13,26,45,52,83],"his":[14,38],"lower":[16,40],"bounds":[17,41],"hold":[18],"for":[19],"general":[20],"read-once":[21,98],"formulae,":[22],"not":[23,48,75],"necessarily":[24,49],"monotone,":[25,50],"may":[27],"even":[28],"include":[29],"exclusive-or":[30],"gates.":[31],"are":[33],"then":[34],"able":[35],"to":[36,59],"join":[37],"together":[42],"and":[43,80],"any":[46],"read-once,":[47],"formula":[51],"amplifies":[53],"(p-/sup":[54],"1///sub":[55,57],"n/,p+/sup":[56],"n/)":[58],"(2/sup":[60],"-n/,1-2/sup":[61],"-n/)":[62],"has":[63],"size":[64],"of":[65,86],"at":[66],"least":[67],"Omega":[68],"(n/sup":[69],"alpha":[70],"+2/).":[71],"This":[72],"result":[73],"does":[74],"follow":[76],"from":[77],"arguments":[79],"it":[81],"shows":[82],"the":[84,94],"amount":[85],"amplification":[87],"achieved":[88],"by":[89],"L.G.":[90],"Valiant":[91],"(1984)":[92],"is":[93],"maximal":[95],"achievable":[96],"using":[97],"formulae.>":[99]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-10-06T10:28:23.643775","created_date":"2025-10-10T00:00:00"}