Equivalence and Isomorphism for Boolean Constraint Satisfaction
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
The complexity of equivalence and isomorphism of systems of equations over finite groups
Theoretical Computer Science - Mathematical foundations of computer science 2004
Complexity of DNF minimization and isomorphism testing for monotone formulas
Information and Computation
Complexity classes of equivalence problems revisited
Information and Computation
The complexity of game isomorphism
Theoretical Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Complexity of DNF and isomorphism of monotone formulas
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Isomorphism testing of boolean functions computable by constant-depth circuits
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On the complexity of game isomorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We investigate the computational complexity of the formula isomorphism problem (FI): on input of two boolean formulas F and G decide whether there exists a permutation of the variables of G such that F and G become equivalent. FI is contained in ${\Sigma_{2}{\bf P}}$, the second level of the polynomial hierarchy.Our main result is a one-round interactive proof for the complementary formula nonisomorphism problem (FNI), where the verifier has access to an NP-oracle. To obtain this, we use a result from learning theory by Bshouty et al. that boolean formulas can be learned probabilistically with equivalence queries and access to an NP-oracle. As a consequence, FI cannot be ${\Sigma_{2}{\bf P}}$-complete unless the polynomial hierarchy collapses.Further properties of FI are shown: FI has and- and or-functions, the counting version, #FI, can be computed in polynomial time relative to FI, and FI is self-reducible.