{"id":"https://openalex.org/W1993180032","doi":"https://doi.org/10.1137/0218073","title":"Polynomial Space Counting Problems","display_name":"Polynomial Space Counting Problems","publication_year":1989,"publication_date":"1989-12-01","ids":{"openalex":"https://openalex.org/W1993180032","doi":"https://doi.org/10.1137/0218073","mag":"1993180032"},"language":"en","primary_location":{"id":"doi:10.1137/0218073","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218073","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/A5043369298","display_name":"Richard E. Ladner","orcid":"https://orcid.org/0000-0001-9413-6774"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]},{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Richard E. Ladner","raw_affiliation_strings":["University of Washington , Seattle"],"affiliations":[{"raw_affiliation_string":"University of Washington , Seattle","institution_ids":["https://openalex.org/I58610484","https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043369298"],"corresponding_institution_ids":["https://openalex.org/I201448701","https://openalex.org/I58610484"],"apc_list":null,"apc_paid":null,"fwci":0.4784,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.59422146,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"18","issue":"6","first_page":"1087","last_page":"1097"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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/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.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.956048846244812},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.745397686958313},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6764878034591675},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6764798164367676},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6755048036575317},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.6241040229797363},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5602279901504517},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.548995852470398},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.5364089608192444},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4900859594345093},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.4836355447769165},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.42739346623420715},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42528074979782104},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4141746461391449},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2581804096698761},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.252827525138855},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15035578608512878},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.129418283700943},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.10566979646682739}],"concepts":[{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.956048846244812},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.745397686958313},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6764878034591675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6764798164367676},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6755048036575317},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6241040229797363},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5602279901504517},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.548995852470398},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.5364089608192444},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4900859594345093},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.4836355447769165},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.42739346623420715},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42528074979782104},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4141746461391449},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2581804096698761},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.252827525138855},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15035578608512878},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.129418283700943},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.10566979646682739},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"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.1137/0218073","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218073","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1993138363","https://openalex.org/W1998084650","https://openalex.org/W2006912660","https://openalex.org/W2014603110","https://openalex.org/W2065251436","https://openalex.org/W2088141885","https://openalex.org/W2089914953","https://openalex.org/W2115826669","https://openalex.org/W2401610261","https://openalex.org/W4241108585"],"related_works":["https://openalex.org/W1486286946","https://openalex.org/W2122747219","https://openalex.org/W4288351008","https://openalex.org/W4236121173","https://openalex.org/W2949308819","https://openalex.org/W2095274905","https://openalex.org/W2053392269","https://openalex.org/W2075449032","https://openalex.org/W2015895898","https://openalex.org/W1504200807"],"abstract_inverted_index":{"The":[0],"classes":[1],"of":[2,26,29,45,48,66,80,97,111,170,190,193],"functions":[3,38,98,112,171],"$#":[4,15,21,76,82,91,125,142],"\\textit{PSPACE}$":[5,8,22,41,83,86,126,129,143,146],"and":[6,37,84,103,127,144],"$\\natural":[7,40,85,104,128,145],"that":[9,55,156],"are":[10,17,87,182],"analogous":[11],"to":[12,71,137,177],"the":[13,24,43,168,194],"class":[14,96,110,169],"P$":[16],"defined.":[18],"Functions":[19],"in":[20,39,100,114,173],"count":[23,42],"number":[25,44,65],"accepting":[27,46],"computations":[28,47],"a":[30,63,122,187],"nondeterministic":[31,49,67],"polynomial":[32,50,64,101,115,174],"space":[33,51,116],"bounded":[34,52,120],"Turing":[35,53,139],"machine,":[36],"machines":[54],"on":[56],"each":[57],"computation":[58],"path":[59],"make":[60],"at":[61],"most":[62],"choices.":[68],"In":[69,89],"contrast":[70],"what":[72],"is":[73,152,167,179,197],"known":[74],"about":[75],"P$,":[77],"exact":[78],"characterizations":[79],"both":[81],"found.":[88],"particular,":[90],"PSPACE":[92,105],"=":[93,106],"FSPACE$":[94],"(the":[95,109],"computable":[99,113,172],"space)":[102],"FSPACE":[107],"(poly)$":[108],"with":[117],"output":[118],"length":[119],"by":[121,133],"polynomial).":[123],"Both":[124,141],"can":[130],"be":[131],"characterized":[132],"counting":[134],"problems":[135],"related":[136],"alternating":[138],"machines.":[140],"have":[147],"natural":[148],"complete":[149],"functions.":[150],"It":[151],"an":[153],"easy":[154],"observation":[155],"$FP":[157],"\\subseteq":[158,161],"#":[159],"P":[160],"\\natural":[162],"\\textit{PSPACE}":[163],"$,":[164],"where":[165],"$FP$":[166],"time.":[175],"Relativization":[176],"oracles":[178],"considered,":[180],"as":[181],"approximation":[183],"techniques":[184],"for":[185],"obtaining":[186],"better":[188],"understanding":[189],"whether":[191],"either":[192],"above":[195],"inclusions":[196],"proper.":[198]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}