Abstract
In the present paper we study the complexity of Boolean equivalence problems (i.e. have two given propositional formulas the same truthtable) and of Boolean isomorphism problems (i.e. does there exists a permutation of the variables of one propositional formula, such that the truthtable of this modified formula coincides with the truthtable of the second formula) of two given generalized propositional formulas and certain classes of Boolean circuits.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, M., Thierauf, T.: The Boolean isomorphism problem. In: 37th Symposium on Foundation of Computer Science, pp. 422–430. IEEE Computer Society Press, Los Alamitos (1996)
Böhler, E., Hemaspaandra, E., Reith, S., Vollmer, H.: Equivalence problems for boolean constraint satisfaction. In: Proc. Computer Science Logic. LNCS, Springer, Heidelberg (2002)
Borchert, B., Ranjan, D., Stefan, F.: On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions. Theory of Computing Systems 31, 679–693 (1998)
Goldschlager, L.M., Parberry, I.: On The Construction Of Parallel Computers From Various Bases Of Boolean Functions. Theoretical Computer Science 43, 43–58 (1986)
Hertrampf, U., Reith, S., Vollmer, H.: A note on closure properties of logspace MOD classes. Information Processing Letters 75, 91–93 (2000)
Immerman, N.: Nondeterministic space is closed under complementation. SIAM Journal on Computing 17(5), 935–938 (1988)
Jablonski, S.W., Gawrilow, G.P., Kudrajawzew, W.B.: Boolesche Funktionen und Postsche Klassen. Akademie-Verlag (1970)
Lewis, H.R.: Satisfiability Problems for Propositional Calculi. Mathematical Systems Theory 13, 45–53 (1979)
Post, E.L.: The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies 5, 1–122 (1941)
Reith, S.: Generalized Satisfiability Problems. PhD thesis, University of Würzburg (2001)
Reith, S., Wagner, K.W.: The Complexity of Problems Defined by Boolean Circuits. Technical Report 255, Institut für Informatik, Universität Würzburg (2000); To appear in Proceedings International Conference Mathematical Foundation of Informatics, Hanoi, October 25–28 (1999)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proccedings 10th Symposium on Theory of Computing, pp. 216–226. ACM Press, New York (1978)
Szelepcsényi, R.: The method of forcing for nondeterministic automata. Bulletin of the European Association for Theoretical Computer Science 33, 96–100 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reith, S. (2003). On the Complexity of Some Equivalence Problems for Propositional Calculi. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-45138-9_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40671-6
Online ISBN: 978-3-540-45138-9
eBook Packages: Springer Book Archive