Richard Beigel, William I. Gasarch, Martin Kummer, Timothy McNicholl, Frank Stephan. On the Query Complexity of Sets. In Wojciech Penczek, Andrzej Szalas, editors, Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS 96, Cracow, Poland, September 2-6, 1996, Proceedings. Volume 1113 of Lecture Notes in Computer Science, pages 206-217, Springer, 1996.
@inproceedings{BeigelGKMS96,
title = {On the Query Complexity of Sets},
author = {Richard Beigel and William I. Gasarch and Martin Kummer and Timothy McNicholl and Frank Stephan},
year = {1996},
researchr = {https://researchr.org/publication/BeigelGKMS96},
cites = {0},
citedby = {0},
pages = {206-217},
booktitle = {Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS 96, Cracow, Poland, September 2-6, 1996, Proceedings},
editor = {Wojciech Penczek and Andrzej Szalas},
volume = {1113},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-61550-4},
}