On the Complexity of Some Equivalence Problems for Propositional Calculi.

Steffen Reith

Browse the full MFCS paper archive.