Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > NOGA ALON:
All reports by Author Noga Alon:

TR26-159 | 21st August 2026
Noga Alon, Shay Moran, Shlomo Moran

Sorting from Counterexamples

Consider the following problem of learning an unknown linear order on $n$ items. In each round, the learner guesses a complete ordering of the items and receives either confirmation that the guess is correct or a counterexample:
a pair of items in the wrong order. The goal is to identify ... more >>>




ISSN 1433-8092 | Imprint