"The Complexity of Collapsing Reachability Graphs."

Sudhir Aggarwal et al. (1989)

> Home

Details and statistics

DOI: 10.1007/3-540-52148-8_22

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/avmfss/AggarwalBCG89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/avmfss/AggarwalBCG89
Sudhir Aggarwal, Daniel Barbará, Walter Cunto, M. R. Garey:
The Complexity of Collapsing Reachability Graphs. Automatic Verification Methods for Finite State Systems 1989: 264-274

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.