Conference paper
On the Number of Quantifiers as a Complexity Measure
Ronald Fagin, Jonathan Lenchner, et al.
MFCS 2022
Paper
Comparing partial rankings
Abstract
We provide a comprehensive picture of how to compare partial rankings, that is, rankings that allow ties. We propose several metrics to compare partial rankings and prove that they are within constant multiples of each other. © 2006 Society for Industrial and Applied Mathematics.
Related
Conference paper
An improved data stream algorithm for frequency moments
Don Coppersmith, Ravi Kumar
SODA 2004
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Conference paper
Dichotomies in the Complexity of Preferred Repairs
Ronald Fagin, Benny Kimelfeld, et al.
SIGMOD/PODS 2015