Efficient SAT-Based Search for Longest Sensitisable Paths - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Matthias Sauer, Jie Jiang, Alejandro Czutro, Ilia Polian, Bernd Becker. Efficient SAT-Based Search for Longest Sensitisable Paths. In Proceedings of the 20th IEEE Asian Test Symposium, ATS 2011, New Delhi, India, November 20-23, 2011. pages 108-113, IEEE Computer Society, 2011. [doi]

This author has not been identified. Look up 'Matthias Sauer' in GoogleThis author has not been identified. Look up 'Jie Jiang' in GoogleThis author has not been identified. Look up 'Alejandro Czutro' in GoogleThis author has not been identified. Look up 'Ilia Polian' in GoogleThis author has not been identified. Look up 'Bernd Becker' in Google

runs on WebDSL