Steffen Reith. On the Complexity of Some Equivalence Problems for Propositional Calculi. In Branislav Rovan, Peter Vojtás, editors, Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings. Volume 2747 of Lecture Notes in Computer Science, pages 632-641, Springer, 2003. [doi]
No references recorded for this publication.
No citations of this publication recorded.