乐胖代购免代理版

{"id":"https://openalex.org/W2009353303","doi":"https://doi.org/10.1002/rsa.3240060108","title":"On the Monte carlo boolean decision tree complexity of read\u2010once formulae","display_name":"On the Monte carlo boolean decision tree complexity of read\u2010once formulae","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2009353303","doi":"https://doi.org/10.1002/rsa.3240060108","mag":"2009353303"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240060108","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5046562790","display_name":"Mikl\u00f3s S\u00e1ntha","orcid":null},"institutions":[{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"funder","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Miklos Santha","raw_affiliation_strings":["CNRS, URA 410, Universit\u00e9 Paris\u2010Sud, LRI, 91405 Orsay, France#TAB#"],"affiliations":[{"raw_affiliation_string":"CNRS, URA 410, Universit\u00e9 Paris\u2010Sud, LRI, 91405 Orsay, France#TAB#","institution_ids":["https://openalex.org/I4210144804","https://openalex.org/I102197404","https://openalex.org/I1294671590"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046562790"],"corresponding_institution_ids":["https://openalex.org/I4210144804","https://openalex.org/I102197404","https://openalex.org/I1294671590"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":0.481,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":66,"citation_normalized_percentile":{"value":0.93196,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":95},"biblio":{"volume":"6","issue":"1","first_page":"75","last_page":"87"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9918,"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.9918,"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.9857,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9821,"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/las-vegas","display_name":"Las vegas","score":0.80750585},{"id":"https://openalex.org/keywords/monte-carlo-algorithm","display_name":"Monte Carlo algorithm","score":0.4991796},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.495109},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4139449}],"concepts":[{"id":"https://openalex.org/C2993101906","wikidata":"https://www.wikidata.org/wiki/Q23768","display_name":"Las vegas","level":3,"score":0.80750585},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.7771971},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.566805},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5378411},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5019376},{"id":"https://openalex.org/C15482360","wikidata":"https://www.wikidata.org/wiki/Q15238499","display_name":"Monte Carlo algorithm","level":3,"score":0.4991796},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.495109},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47716016},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43630257},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4298622},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4275008},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4139449},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35633948},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.321052},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30625242},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12841812},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"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/C158739034","wikidata":"https://www.wikidata.org/wiki/Q1907114","display_name":"Metropolitan area","level":2,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240060108","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.53,"display_name":"Peace, justice, and strong institutions","id":"https://metadata.un.org/sdg/16"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":12,"referenced_works":["https://openalex.org/W1496913341","https://openalex.org/W1516554202","https://openalex.org/W1965171998","https://openalex.org/W1972416792","https://openalex.org/W2016606569","https://openalex.org/W2026325622","https://openalex.org/W2041763757","https://openalex.org/W2042468189","https://openalex.org/W2094321606","https://openalex.org/W2100552177","https://openalex.org/W2123540893","https://openalex.org/W2130774424"],"related_works":["https://openalex.org/W86917440","https://openalex.org/W3140601928","https://openalex.org/W257150968","https://openalex.org/W2168881618","https://openalex.org/W2133491672","https://openalex.org/W2110222718","https://openalex.org/W2109998394","https://openalex.org/W2057159994","https://openalex.org/W1977451125","https://openalex.org/W1608751818"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"the":[2,15,19,28,45,65,105,124,136],"boolean":[3],"decision":[4],"tree":[5],"model":[6],"there":[7],"is":[8,44,75,90,133],"at":[9],"least":[10],"a":[11,24,34,48,116],"linear":[12],"gap":[13],"between":[14],"Monte":[16,49,66,125],"Carlo":[17,50,67,126],"and":[18,85,142],"Las":[20,106,146],"Vegas":[21,107,147],"complexity":[22,68,108,127],"of":[23,37,69,109,128],"function":[25],"depending":[26],"on":[27,123,144],"error":[29,73,88],"probability.":[30],"We":[31],"prove":[32],"for":[33],"large":[35],"class":[36,61],"read\u2010once":[38],"formulae":[39],"that":[40,47,60,64,120],"this":[41],"trivial":[42],"speed\u2010up":[43],"best":[46],"algorithm":[51],"can":[52],"achieve.":[53],"For":[54],"every":[55],"formula":[56],"F":[57,70,83,97,102,110],"belonging":[58],"to":[59,135,140],"we":[62,121],"show":[63],"with":[71,86],"two\u2010sided":[72],"p":[74,79,89,93],"(1":[76,91],"\u2212":[77,92],"2":[78],")":[80,94,103],"R":[81,95,100],"(":[82,96,101],"),":[84,98],"one\u2010sided":[87],"where":[99],"denotes":[104],".":[111],"The":[112],"result":[113],"follows":[114],"from":[115],"general":[117],"lower":[118,137],"bound":[119,132,138],"derive":[122],"these":[129],"formulae.":[130],"This":[131],"analogous":[134],"due":[139],"Saks":[141],"Wigderson":[143],"their":[145],"complexity.":[148]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2009353303","counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-02-23T01:20:26.505539","created_date":"2016-06-24"}