{"id":"https://openalex.org/W2060136292","doi":"https://doi.org/10.1142/s0129054197000070","title":"Logspace Reducibility: Models and Equivalences","display_name":"Logspace Reducibility: Models and Equivalences","publication_year":1997,"publication_date":"1997-03-01","ids":{"openalex":"https://openalex.org/W2060136292","doi":"https://doi.org/10.1142/s0129054197000070","mag":"2060136292"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054197000070","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054197000070","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of 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/A5088546793","display_name":"Lane A. Hemaspaandra","orcid":"https://orcid.org/0000-0003-0659-5204"},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lane A. Hemaspaandra","raw_affiliation_strings":["Dept. of Computer Science, University of Rochester, Rochester, NY 14627, USA","Dept. of Computer Science, University of Rochester, Rochester, NY, 14627, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Rochester, Rochester, NY 14627, USA","institution_ids":["https://openalex.org/I5388228"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Rochester, Rochester, NY, 14627, USA","institution_ids":["https://openalex.org/I5388228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044020537","display_name":"Zhigen Jiang","orcid":null},"institutions":[{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"funder","lineage":["https://openalex.org/I19820366"]},{"id":"https://openalex.org/I4210128818","display_name":"Institute of Software","ror":"https://ror.org/033dfsn42","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210128818"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhigen Jiang","raw_affiliation_strings":["Institute of Software, Chinese Academy of Sciences, Beijing 100080, China","Institute of Software, Chinese Academy of Sciences, BeiJing 100080, China"],"affiliations":[{"raw_affiliation_string":"Institute of Software, Chinese Academy of Sciences, Beijing 100080, China","institution_ids":["https://openalex.org/I4210128818","https://openalex.org/I19820366"]},{"raw_affiliation_string":"Institute of Software, Chinese Academy of Sciences, BeiJing 100080, China","institution_ids":["https://openalex.org/I19820366"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088546793"],"corresponding_institution_ids":["https://openalex.org/I5388228"],"apc_list":null,"apc_paid":null,"fwci":0.6038,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76642967,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"08","issue":"01","first_page":"95","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9976000189781189,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9976000189781189,"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.9966999888420105,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/oracle","display_name":"Oracle","score":0.8712612986564636},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.7650867700576782},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.638574481010437},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.5725759863853455},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5577714443206787},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.5354791879653931},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.5224960446357727},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43866896629333496},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42689359188079834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3786892890930176},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3708083927631378},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3406063914299011},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18656525015830994},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.12545126676559448},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11321797966957092}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.8712612986564636},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7650867700576782},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.638574481010437},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.5725759863853455},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5577714443206787},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.5354791879653931},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.5224960446357727},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43866896629333496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42689359188079834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3786892890930176},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3708083927631378},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3406063914299011},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18656525015830994},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.12545126676559448},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11321797966957092},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054197000070","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054197000070","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.54.9151","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.9151","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hypatia.dcs.qmw.ac.uk/data/edu/cs.rochester.edu/theory/95.tr544rev.Logspace_reducibility_Models_and_equivalences.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W31087064","https://openalex.org/W1978001037","https://openalex.org/W1980326341","https://openalex.org/W2963860960","https://openalex.org/W1584225668","https://openalex.org/W1969470083","https://openalex.org/W1605801996","https://openalex.org/W4312201671","https://openalex.org/W192442233","https://openalex.org/W4254404873"],"abstract_inverted_index":{"We":[0,33,58],"study":[1,13],"the":[2,14,24,30,49,55],"relative":[3],"computational":[4],"power":[5],"of":[6,23,29],"logspace":[7,61],"reduction":[8],"models.":[9],"In":[10],"particular,":[11],"we":[12],"relationships":[15],"between":[16,41],"one-way":[17],"and":[18,27,75],"two-way":[19],"oracle":[20,25,31,36],"tapes,":[21],"resetting":[22],"head,":[26],"blanking":[28],"tape.":[32],"show":[34,59],"that":[35,60,76],"models":[37],"letting":[38],"information":[39,50],"persist":[40],"queries":[42],"can":[43],"be":[44],"quite":[45],"powerful,":[46],"even":[47],"if":[48,80],"is":[51,78],"not":[52],"readable":[53],"by":[54],"querying":[56],"machine.":[57],"f(n)-Turing":[62,68],"reductions":[63,69],"are":[64],"stronger":[65],"than":[66],"polynomial-time":[67],"when":[70],"f(n)":[71],"=":[72,82],"\u03c9(log":[73],"n),":[74],"this":[77],"optimal":[79],"P":[81],"L.":[83]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}