The following pages link to The Formula Isomorphism Problem (Q4507381):
Displaying 12 items.
- Isomorphism testing of Boolean functions computable by constant-depth circuits (Q476155) (← links)
- The complexity of game isomorphism (Q650900) (← links)
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- Some results of Maria Serna on strategic games: complexity of equilibria and models (Q826318) (← links)
- Efficient computation of approximate isomorphisms between Boolean functions (Q903194) (← links)
- Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444) (← links)
- Isomorphic implication (Q2272203) (← links)
- On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
- The complexity of equivalence and isomorphism of systems of equations over finite groups (Q2575758) (← links)
- Isomorphism testing of read-once functions and polynomials (Q2672283) (← links)
- ON HIGHER ARTHUR-MERLIN CLASSES (Q5696962) (← links)
