• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Complexity of reachability problems for finite discrete dynamical systems.

Christopher L. BarrettHarry B. Hunt IIIMadhav V. MaratheS. S. RaviDaniel J. RosenkrantzRichard Edwin Stearns
Published in: J. Comput. Syst. Sci. (2006)
Keyphrases
  • decision problems
  • optimization problems
  • information retrieval
  • data sets
  • solving problems
  • related problems
  • databases
  • lower bound
  • relational databases
  • data model
  • difficult problems
  • np hardness
  • complexity bounds