Reducibility concepts are fundamental in complexity theory. Usually, they are defined as follows: A problem P is reducible to a problem S if P can be computed using a program or device for S as a subroutine. However, in the case of such restricted models as ordered binary decision diagrams ... more >>>