Abstract
In the present paper1 we study the complexity of Boolean equivalence problems (i.e. have two given prepositional formulas the same truthtable) and of Boolean isomorphism problems (i.e. does there exists a permutation of the variables of one prepositional 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. © Springer-Verlag Berlin Heidelberg 2003.
Author supplied keywords
Cite
CITATION STYLE
Reith, S. (2003). On the complexity of some equivalence problems for propositional calculi. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2747, 632–641. https://doi.org/10.1007/978-3-540-45138-9_57
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
