"Efficient SAT-Based Search for Longest Sensitisable Paths."

Matthias Sauer et al. (2011)

> Home

Details and statistics

DOI: 10.1109/ATS.2011.43

access: closed

type: Conference or Workshop Paper

metadata version: 2024-04-11

- view
  authority control:
- export record
  dblp key:
  - conf/ats/SauerJCPB11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ats/SauerJCPB11
Matthias Sauer, Jie Jiang, Alejandro Czutro, Ilia Polian, Bernd Becker:
Efficient SAT-Based Search for Longest Sensitisable Paths. Asian Test Symposium 2011: 108-113

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.