{"id":"https://openalex.org/W7124225406","doi":"https://doi.org/10.48550/arxiv.2601.08073","title":"Monte Carlo to Las Vegas for Recursively Composed Functions","display_name":"Monte Carlo to Las Vegas for Recursively Composed Functions","publication_year":2026,"publication_date":"2026-01-12","ids":{"openalex":"https://openalex.org/W7124225406","doi":"https://doi.org/10.48550/arxiv.2601.08073"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.08073","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.08073","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.08073","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050031357","display_name":"Bandar Al-Dhalaan","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Al-Dhalaan, Bandar","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Ben-David, Shalev","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ben-David, Shalev","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050031357"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.6636000275611877,"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.6636000275611877,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.20669999718666077,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.03759999945759773,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.5665000081062317},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.503600001335144},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.49129998683929443},{"id":"https://openalex.org/keywords/las-vegas","display_name":"Las vegas","score":0.4374000132083893},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.4097000062465668},{"id":"https://openalex.org/keywords/composition","display_name":"Composition (language)","score":0.38019999861717224},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.3732999861240387},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.36649999022483826}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.642799973487854},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5665000081062317},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.503600001335144},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.49129998683929443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4733000099658966},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46790000796318054},{"id":"https://openalex.org/C2993101906","wikidata":"https://www.wikidata.org/wiki/Q23768","display_name":"Las vegas","level":3,"score":0.4374000132083893},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.4097000062465668},{"id":"https://openalex.org/C40231798","wikidata":"https://www.wikidata.org/wiki/Q1333743","display_name":"Composition (language)","level":2,"score":0.38019999861717224},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3732999861240387},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.36649999022483826},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.34380000829696655},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.3434999883174896},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.33390000462532043},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.32409998774528503},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31470000743865967},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30660000443458557},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.30149999260902405},{"id":"https://openalex.org/C166785042","wikidata":"https://www.wikidata.org/wiki/Q190391","display_name":"Central limit theorem","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.2919999957084656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29190000891685486},{"id":"https://openalex.org/C203313322","wikidata":"https://www.wikidata.org/wiki/Q5158394","display_name":"Concept class","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2583000063896179}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.08073","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.08073","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.08073","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.08073","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"For":[0],"a":[1,10,58,89,108,116,121],"(possibly":[2],"partial)":[3],"Boolean":[4,17],"function":[5],"$f\\colon\\{0,1\\}^n\\to\\{0,1\\}$":[6],"as":[7,9],"well":[8],"query":[11,42,67],"complexity":[12],"measure":[13],"$M$":[14,27],"which":[15],"maps":[16],"functions":[18],"to":[19,101],"real":[20],"numbers,":[21],"define":[22],"the":[23,35,53,62,94,127],"composition":[24,36,63,137],"limit":[25,47,64],"of":[26,38,65,134],"on":[28,104],"$f$":[29],"by":[30],"$M^*(f)=\\lim_{k\\to\\infty}":[31],"M(f^k)^{1/k}$.":[32],"We":[33,44,55],"study":[34],"limits":[37],"general":[39],"measures":[40,135],"in":[41],"complexity.":[43],"show":[45,70],"this":[46,75],"converges":[48],"under":[49],"reasonable":[50],"assumptions":[51],"about":[52],"measure.":[54],"then":[56],"give":[57],"surprising":[59],"result":[60,98],"regarding":[61],"randomized":[66,80,91],"complexity:":[68],"we":[69,129],"$R_0^*(f)=\\max\\{R^*(f),C^*(f)\\}$.":[71],"Among":[72],"other":[73],"things,":[74],"implies":[76],"that":[77,119],"any":[78],"bounded-error":[79,109],"algorithm":[81,92,111,118],"for":[82,93],"recursive":[83],"3-majority":[84],"can":[85,112],"be":[86,113],"turned":[87],"into":[88,115],"zero-error":[90],"same":[95],"task.":[96],"Our":[97],"extends":[99],"also":[100],"quantum":[102,110,117],"algorithms:":[103],"recursively":[105],"composed":[106],"functions,":[107],"converted":[114],"finds":[120],"certificate":[122],"with":[123],"high":[124],"probability.":[125],"Along":[126],"way,":[128],"prove":[130],"various":[131],"combinatorial":[132],"properties":[133],"and":[136],"limits.":[138]},"counts_by_year":[],"updated_date":"2026-03-25T23:56:10.502304","created_date":"2026-01-15T00:00:00"}