{"id":"https://openalex.org/W2034774429","doi":"https://doi.org/10.1145/6490.6496","title":"Polynomial-time algorithm for the orbit problem","display_name":"Polynomial-time algorithm for the orbit problem","publication_year":1986,"publication_date":"1986-08-10","ids":{"openalex":"https://openalex.org/W2034774429","doi":"https://doi.org/10.1145/6490.6496","mag":"2034774429"},"language":"en","primary_location":{"id":"doi:10.1145/6490.6496","doi":"https://doi.org/10.1145/6490.6496","is_oa":true,"landing_page_url":"https://doi.org/10.1145/6490.6496","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/6490.6496","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/6490.6496","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059436381","display_name":"Ravi Kannan","orcid":"https://orcid.org/0000-0002-6412-4550","observed_orcids":["https://orcid.org/0000-0002-6412-4550"]},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Kannan","raw_affiliation_strings":["Univ. of California, Berkeley","University of California, Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109131294","display_name":"R.J. Lipton","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. J. Lipton","raw_affiliation_strings":["Univ. of California, Berkeley","University of California, Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":95,"citation_normalized_percentile":{"value":0.18838863,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"33","issue":"4","first_page":"808","last_page":"821"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.4530999958515167,"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.4530999958515167,"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.3537999987602234,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.1306000053882599,"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/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.7329999804496765},{"id":"https://openalex.org/keywords/decidability","display_name":"decidability","score":0.9120000004768372},{"id":"https://openalex.org/keywords/accessibility-problems","display_name":"accessibility problems","score":0.9490000009536743},{"id":"https://openalex.org/keywords/rational-matrices","display_name":"rational matrices","score":0.6600000262260437},{"id":"https://openalex.org/keywords/linear-recurrence-sequences","display_name":"linear recurrence sequences","score":0.8370000123977661}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8544793128967285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6239702701568604},{"id":"https://openalex.org/C196644772","wikidata":"https://www.wikidata.org/wiki/Q3884964","display_name":"Orbit (dynamics)","level":2,"score":0.6150494813919067},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.582258403301239},{"id":"https://openalex.org/C46875033","wikidata":"https://www.wikidata.org/wiki/Q1244890","display_name":"Rational number","level":2,"score":0.548646092414856},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5395841002464294},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5253514647483826},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5214787721633911},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.4894203245639801},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45816993713378906},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44830504059791565},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.44715145230293274},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3864206075668335},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09225398302078247},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/6490.6496","doi":"https://doi.org/10.1145/6490.6496","is_oa":true,"landing_page_url":"https://doi.org/10.1145/6490.6496","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/6490.6496","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/6490.6496","doi":"https://doi.org/10.1145/6490.6496","is_oa":true,"landing_page_url":"https://doi.org/10.1145/6490.6496","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/6490.6496","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3567910742","display_name":"Computational Complexity of Numerical Algorithms            (Computer Research)","funder_award_id":"8304770","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3626400950","display_name":"Computational Complexity","funder_award_id":"7920409","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G412591299","display_name":"Computational Complexity of Numerical Algorithms","funder_award_id":"8105557","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6004241994","display_name":"Analysis of Algorithms","funder_award_id":"7709906","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2034774429.pdf","grobid_xml":"https://content.openalex.org/works/W2034774429.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W177509178","https://openalex.org/W218207296","https://openalex.org/W632411630","https://openalex.org/W649173217","https://openalex.org/W1484040084","https://openalex.org/W1495550473","https://openalex.org/W1514293779","https://openalex.org/W1515502113","https://openalex.org/W1573366733","https://openalex.org/W1859552527","https://openalex.org/W1981441803","https://openalex.org/W2038768554","https://openalex.org/W2049160253","https://openalex.org/W2050735826","https://openalex.org/W2059568104","https://openalex.org/W2078527527","https://openalex.org/W2085219656","https://openalex.org/W2100279776","https://openalex.org/W4248480617","https://openalex.org/W4298237972","https://openalex.org/W6608599494","https://openalex.org/W6662900571"],"related_works":["https://openalex.org/W2508096977","https://openalex.org/W4321514130","https://openalex.org/W4297778831","https://openalex.org/W4245024105","https://openalex.org/W2520067680","https://openalex.org/W1972495134","https://openalex.org/W4230071522","https://openalex.org/W2601782347","https://openalex.org/W2509885431","https://openalex.org/W4239203488"],"abstract_inverted_index":{"The":[0,163],"accessibility":[1],"problem":[2,10,44,116,142,151,165,179,192],"for":[3,126,152,180,189],"linear":[4,52,173],"sequential":[5],"machines":[6],"[12]":[7],"is":[8,15,45,70,98,117,136,143,155],"the":[9,23,48,58,114,124,141,149,176,190],"of":[11,92,171],"deciding":[12],"whether":[13,96],"there":[14,97],"an":[16],"input":[17],"x":[18,22,81,85,89,107],"such":[19,103],"that":[20,42,104,113,133,148],"on":[21,123],"machine":[24],"starting":[25],"in":[26,160,167,193],"a":[27,34,71,99],"given":[28,35],"state":[29,36],"q":[30,37],"1":[31,90],"goes":[32],"to":[33,47],"2":[38],".":[39,110],"Harrison":[40],"shows":[41,147],"this":[43],"reducible":[46],"following":[49],"simply":[50],"stated":[51],"algebra":[53],"problem,":[54],"which":[55],"we":[56,185],"call":[57],"\"orbit":[59],"problem\":":[60],"Given":[61],"(":[62],"n,":[63],"A,":[64,75],"x,":[65,76],"y":[66,78,109],"),":[67],"where":[68],"n":[69,80,82,84,88,135,154],"natural":[72,100],"number":[73,101],"and":[74,77,87,157,175,184],"are":[79,182],",":[83],"1,":[86],"matrices":[91],"rationals,":[93],"respectively,":[94],"decide":[95],"I":[102],"A":[105],"i":[106],"=":[108],"He":[111],"conjectured":[112],"orbit":[115,150,164,191],"decidable.":[118,144],"No":[119],"progress":[120],"was":[121],"made":[122],"conjecture":[125],"ten":[127],"years":[128],"until":[129],"Shank":[130],"[22]":[131],"showed":[132],"if":[134],"fixed":[137],"at":[138],"2,":[139],"then":[140],"This":[145],"paper":[146],"general":[153],"decidable":[156,159],"indeed":[158],"polynomial":[161],"time.":[162],"arises":[166],"several":[168],"contexts;":[169],"two":[170],"these,":[172],"recurrences":[174],"discrete":[177],"logarithm":[178],"polynomials,":[181],"discussed,":[183],"apply":[186],"our":[187],"algorithm":[188],"these":[194],"contexts.":[195]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2025-10-10T00:00:00"}