{"id":"https://openalex.org/W2092842790","doi":"https://doi.org/10.1016/0304-3975(91)90317-u","title":"On the complexity of counting in the polynomial hierarchy","display_name":"On the complexity of counting in the polynomial hierarchy","publication_year":1991,"publication_date":"1991-04-01","ids":{"openalex":"https://openalex.org/W2092842790","doi":"https://doi.org/10.1016/0304-3975(91)90317-u","mag":"2092842790"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(91)90317-u","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(91)90317-u","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5042257072","display_name":"Marek Piotr\u00f3w","orcid":"https://orcid.org/0000-0002-4734-1721"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Marek Piotr\u00f3w","raw_affiliation_strings":["University of Wroclaw Wroclaw Poland"],"affiliations":[{"raw_affiliation_string":"University of Wroclaw Wroclaw Poland","institution_ids":["https://openalex.org/I219388962"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042257072"],"corresponding_institution_ids":["https://openalex.org/I219388962"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23602089,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"81","issue":"1","first_page":"77","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"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/hierarchy","display_name":"Hierarchy","score":0.584640383720398},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5663295984268188},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5024442672729492},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4759123921394348},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44878295063972473},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.4401799440383911},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43292805552482605},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.43282434344291687},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4221486747264862},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37719178199768066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25256961584091187}],"concepts":[{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.584640383720398},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5663295984268188},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5024442672729492},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4759123921394348},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44878295063972473},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.4401799440383911},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43292805552482605},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.43282434344291687},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4221486747264862},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37719178199768066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25256961584091187},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(91)90317-u","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(91)90317-u","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1572440476","https://openalex.org/W1724478472","https://openalex.org/W1992440350","https://openalex.org/W2006912660","https://openalex.org/W2014603110","https://openalex.org/W2036656440","https://openalex.org/W2052207834","https://openalex.org/W2060270693","https://openalex.org/W2065251436","https://openalex.org/W2089914953","https://openalex.org/W2093454413","https://openalex.org/W2165293955","https://openalex.org/W2495451020","https://openalex.org/W6634525871","https://openalex.org/W6684346927"],"related_works":["https://openalex.org/W2247609287","https://openalex.org/W1980428853","https://openalex.org/W2153178727","https://openalex.org/W2964237202","https://openalex.org/W2161147766","https://openalex.org/W1559021700","https://openalex.org/W2173966285","https://openalex.org/W2990853482","https://openalex.org/W1589381382","https://openalex.org/W2061042466"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}