On sets with efficient implicit membership tests

The complexity of implicit membership testing is characterized in terms of the well-known complexity class OptP, optimization polynomial time. It is concluded that many complex sets have polynomial-time implicit membership tests. Thus, the complexity of implicit membership testing is closely related to the complexity of optimization.<
>