On Checking Versus Evaluation of Multiple Queries

The plausibility of computing the answers to many membership queries to a hard set with few queries is the subject of the theory of terseness. In this paper, we develop companion theories--both complexity-theoretic and recursion-theoretic-of characteristic vector terseness. These theories ask whether the answers to many membership queries to a hard set can be checked with fewer queries.

• Type: Conference
• Year: 1990
• Where: MFCS
• Authors: William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene
• Keywords: Characteristic Vector Terseness, Hard Set, Membership Queries, MFCS 1990, Theoretical Computer Science