Correctness of Multiplicative Additive Proof Structures is NL-Complete - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Paulin Jacobé de Naurois, Virgile Mogbil. Correctness of Multiplicative Additive Proof Structures is NL-Complete. In Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA. pages 476-485, IEEE Computer Society, 2008. [doi]

This author has not been identified. Look up 'Paulin Jacobé de Naurois' in GoogleThis author has not been identified. Look up 'Virgile Mogbil' in Google

runs on WebDSL