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...

Full description

Saved in:
Bibliographic Details
Published inProceedings Fifth Annual Structure in Complexity Theory Conference pp. 11 - 19
Main Authors Hemachandra, L.A., Hoene, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1990
Subjects
Computer science
Polynomials
Testing
Turing machines
Online AccessGet full text

Cover

More Information
Summary: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.< >
ISBN:0818660724
9780818660726
DOI:10.1109/SCT.1990.113950