Skip to content

Opening book details…

About this Computer Science article

Complexity of Reachability Problems for Finite Discrete Dynamical Systems by Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S.S. Ravi; Daniel J. Rosenkrantz; Richard E. Stearns is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S.S. Ravi; Daniel J. Rosenkrantz; Richard E. Stearns
Publisher
Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0022-0000)
Published
2006
Language
EN
Field
Computer Science (Physical Sciences)

More by Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S.S. Ravi; Daniel J. Rosenkrantz; Richard E. Stearns

Browse all works by Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S.S. Ravi; Daniel J. Rosenkrantz; Richard E. Stearns