{"id":"https://openalex.org/W22993877","doi":null,"title":"The Complexity of Approximate Counting (Preliminary Version)","display_name":"The Complexity of Approximate Counting (Preliminary Version)","publication_year":1983,"publication_date":"1983-01-01","ids":{"openalex":"https://openalex.org/W22993877","mag":"22993877"},"language":"en","primary_location":{"id":"mag:22993877","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/stoc/stoc83.html#Stockmeyer83","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on the Theory of Computing","raw_type":null},"volume":null,"type":"conference-paper","indexed_in":[],"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 J. Stockmeyer","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Larry J. Stockmeyer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5111558966"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.01108033,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"118","last_page":"126"},"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.9785000085830688,"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.9785000085830688,"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.013000000268220901,"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.001500000013038516,"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/approximate-counting","display_name":"approximate counting","score":0.9980000257492065},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.8519999980926514},{"id":"https://openalex.org/keywords/counting-complexity-classes","display_name":"counting complexity classes","score":0.7720000147819519},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.5210000276565552},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"polynomial hierarchy","score":0.33000001311302185},{"id":"https://openalex.org/keywords/probabilistic-complexity-classes","display_name":"probabilistic complexity classes","score":0.32499998807907104}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.619635820388794},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36285632848739624}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:22993877","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/stoc/stoc83.html#Stockmeyer83","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on the Theory of Computing","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W83999768","https://openalex.org/W7097665931","https://openalex.org/W7070793921","https://openalex.org/W2166332856","https://openalex.org/W2739085759","https://openalex.org/W66508742","https://openalex.org/W7100268387","https://openalex.org/W6960379951","https://openalex.org/W7096829924","https://openalex.org/W1492059762"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-10-26T11:51:55.731654","created_date":"2016-06-24T00:00:00"}