Polynomial-time algorithm for the orbit problem
Work
Year: 1986
Type: article
Abstract: The accessibility problem for linear sequential machines [12] is the problem of deciding whether there is an input x such that on x the machine starting in a given state q 1 goes to a given state q 2 ... more
Source: Journal of the ACM
Authors Ramachandran Kannan, R.J. Lipton
Institution University of California, Berkeley
Cites: 20
Cited by: 95
Related to: 10
FWCI:
Citation percentile (by year/subfield): 91.01
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze