MFCS
1990
Springer
13 years 9 months ago
1990
Springer
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 ...