Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
0804.1421
Cited By
A
O
(
log
m
)
O(\log m)
O
(
lo
g
m
)
, deterministic, polynomial-time computable approximation of Lewis Carroll's scoring rule
9 April 2008
Jason A. Covey
Christopher Homan
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"A $O(\log m)$, deterministic, polynomial-time computable approximation of Lewis Carroll's scoring rule"
0 / 0 papers shown
No papers found
Page 1 of 0
