{"id":"https://openalex.org/W2014603110","doi":"https://doi.org/10.1137/0214060","title":"On Approximation Algorithms for # P","display_name":"On Approximation Algorithms for # P","publication_year":1985,"publication_date":"1985-11-01","ids":{"openalex":"https://openalex.org/W2014603110","doi":"https://doi.org/10.1137/0214060","mag":"2014603110"},"language":"en","primary_location":{"id":"doi:10.1137/0214060","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214060","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5111558966","display_name":"Larry Stockmeyer","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Larry Stockmeyer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111558966"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9542,"has_fulltext":false,"cited_by_count":213,"citation_normalized_percentile":{"value":0.92021724,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"14","issue":"4","first_page":"849","last_page":"861"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9980999827384949,"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/mathematics","display_name":"Mathematics","score":0.7017671465873718},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6569323539733887},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5613507628440857},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5023303031921387},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.49135342240333557},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48706939816474915},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46950531005859375},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46092909574508667},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46085184812545776},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4560331106185913},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4484451413154602},{"id":"https://openalex.org/keywords/sample-size-determination","display_name":"Sample size determination","score":0.43931344151496887},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4208076000213623},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36474043130874634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20256546139717102},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.16412478685379028}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7017671465873718},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6569323539733887},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5613507628440857},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5023303031921387},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49135342240333557},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48706939816474915},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46950531005859375},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46092909574508667},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46085184812545776},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4560331106185913},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4484451413154602},{"id":"https://openalex.org/C129848803","wikidata":"https://www.wikidata.org/wiki/Q2564360","display_name":"Sample size determination","level":2,"score":0.43931344151496887},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4208076000213623},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36474043130874634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20256546139717102},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.16412478685379028},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":[{"id":"doi:10.1137/0214060","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214060","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1964053266","https://openalex.org/W1993138363","https://openalex.org/W2005234139","https://openalex.org/W2006912660","https://openalex.org/W2007643787","https://openalex.org/W2020831804","https://openalex.org/W2059442002","https://openalex.org/W2065251436","https://openalex.org/W2097543220","https://openalex.org/W2115826669","https://openalex.org/W2125690626","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W3110702597","https://openalex.org/W2073713056","https://openalex.org/W2125620709","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337","https://openalex.org/W4226126352"],"abstract_inverted_index":{"The":[0],"theme":[1],"of":[2,20,51,75,81,87,109,119,126,132,147,155,173],"this":[3,71,192],"paper":[4,77],"is":[5,91,134],"to":[6,8,37,56,122,162,185],"investigate":[7],"what":[9],"extent":[10],"approximation,":[11],"possibly":[12],"together":[13],"with":[14],"randomization,":[15],"can":[16,34,198],"reduce":[17],"the":[18,46,52,76,85,117,124,145,153,170,174,196],"complexity":[19],"problems":[21,138],"in":[22,31,45,70,139,169],"Valiant\u2019s":[23],"class":[24,47],"#":[25,32,140],"P.":[26],"In":[27,152],"general,":[28],"any":[29,39],"function":[30,44],"P":[33,141],"be":[35,64],"approximated":[36],"within":[38],"constant":[40],"factor":[41],"by":[42,66,93,136],"a":[43,57,79,88,148,159,165,187],"$\\Delta":[48,60,67],"_3^p":[49,61],"$":[50,62,69],"polynomial-time,":[53],"hierarchy.":[54],"Relative":[55],"particular":[58,137],"oracle,":[59],"cannot":[63],"replaced":[65],"_2^p":[68],"result.":[72],"Another":[73],"part":[74],"introduces":[78],"model":[80],"random":[82],"sampling":[83,133],"where":[84],"size":[86,125,146],"set":[89],"X":[90,105,127],"estimated":[92],"checking,":[94],"for":[95,191],"various":[96,107],"\u201csample":[97],"sets\u201d":[98],"S,":[99],"whether":[100,164],"or":[101],"not":[102,183],"S":[103],"intersects":[104],"For":[106],"classes":[108],"sample":[110,160],"sets,":[111],"upper":[112],"and":[113],"lower":[114,175],"bounds":[115,176],"on":[116],"number":[118],"samples":[120],"required":[121],"estimate":[123],"are":[128,182],"discussed.":[129],"This":[130],"type":[131],"motivated":[135],"such":[142,179],"as":[143],"computing":[144],"backtrack":[149,156],"search":[150,157],"tree.":[151,171],"case":[154],"trees,":[158],"amounts":[161],"checking":[163],"certain":[166],"path":[167],"exists":[168],"One":[172],"suggests":[177],"that":[178],"tests":[180],"alone":[181],"sufficient":[184],"give":[186],"polynomial-time":[188],"approximation":[189],"algorithm":[190,197],"problem,":[193],"even":[194],"if":[195],"randomize.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-21T08:13:44.787528","created_date":"2025-10-10T00:00:00"}