A tight bound for the clique query problem in two rounds

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Uriel Feige, Tom Ferster

Journal title: Arxiv

Journal publisher: Arxiv

Published year: 2021