Reproduce “XOR-Functions and Beyond in the Random Query Model” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Sumegha Garg, Janani Sundaresan, Santhoshini Velusamy
The authors prove time-space lower bounds for equality in a random-query model, where an algorithm sees independently sampled input coordinates and their values but cannot choose which coordinate arrives. Their analysis tracks information about the query pattern as well as the input. For Equality, it gives a near-quadratic bound despite low influence, within the stated model and theorem scope.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.