{"id":"https://openalex.org/W176257112","doi":"https://doi.org/10.1007/978-3-642-40313-2_48","title":"Length-Increasing Reductions for PSPACE-Completeness","display_name":"Length-Increasing Reductions for PSPACE-Completeness","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W176257112","doi":"https://doi.org/10.1007/978-3-642-40313-2_48","mag":"176257112"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-40313-2_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40313-2_48","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5077270481","display_name":"John M. Hitchcock","orcid":"https://orcid.org/0000-0002-8614-7307"},"institutions":[{"id":"https://openalex.org/I12834331","display_name":"University of Wyoming","ror":"https://ror.org/01485tq96","country_code":"US","type":"education","lineage":["https://openalex.org/I12834331"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John M. Hitchcock","raw_affiliation_strings":["Department of Computer Science, University of Wyoming, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wyoming, USA","institution_ids":["https://openalex.org/I12834331"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112023986","display_name":"A. Pavan","orcid":"https://orcid.org/0000-0003-1665-5266"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Pavan","raw_affiliation_strings":["Department of Computer Science, Iowa State University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Iowa State University, USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077270481"],"corresponding_institution_ids":["https://openalex.org/I12834331"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09822134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"540","last_page":"550"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T11567","display_name":"semigroups and automata theory","score":0.9991999864578247,"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.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/pspace","display_name":"PSPACE","score":0.895450234413147},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5883392691612244},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5795544981956482},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5654311180114746},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.552724301815033},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5498353838920593},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5360956788063049},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5219887495040894},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4915996491909027},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.45675453543663025},{"id":"https://openalex.org/keywords/advice","display_name":"Advice (programming)","score":0.45168644189834595},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4497872292995453},{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.4435364007949829},{"id":"https://openalex.org/keywords/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.43663376569747925},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4206886291503906},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4107477366924286},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37341272830963135},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22478899359703064},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10783061385154724}],"concepts":[{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.895450234413147},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5883392691612244},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5795544981956482},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5654311180114746},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.552724301815033},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5498353838920593},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5360956788063049},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5219887495040894},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4915996491909027},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.45675453543663025},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.45168644189834595},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4497872292995453},{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.4435364007949829},{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.43663376569747925},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4206886291503906},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4107477366924286},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37341272830963135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22478899359703064},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10783061385154724},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-40313-2_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40313-2_48","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.418.2302","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.418.2302","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uwyo.edu/~jhitchco/papers/lirpc.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.433.3404","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.433.3404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.iastate.edu/~pavan/papers/pspaceli.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W153978737","https://openalex.org/W1503218449","https://openalex.org/W1552748144","https://openalex.org/W1568724636","https://openalex.org/W1975442866","https://openalex.org/W1997491141","https://openalex.org/W2021736779","https://openalex.org/W2036265926","https://openalex.org/W2078896977","https://openalex.org/W2083237534","https://openalex.org/W2090186532","https://openalex.org/W2104611150","https://openalex.org/W2123343497","https://openalex.org/W2137788273","https://openalex.org/W2144718727","https://openalex.org/W2401610261","https://openalex.org/W3149604617"],"related_works":["https://openalex.org/W1504200807","https://openalex.org/W2327776271","https://openalex.org/W1981914472","https://openalex.org/W2956865288","https://openalex.org/W4388327399","https://openalex.org/W1520700928","https://openalex.org/W1583470866","https://openalex.org/W2591371812","https://openalex.org/W2085484366","https://openalex.org/W176257112"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}