ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1703.08041
  4. Cited By
Resolving the Complexity of Some Fundamental Problems in Computational
  Social Choice

Resolving the Complexity of Some Fundamental Problems in Computational Social Choice

23 March 2017
P. Dey
ArXiv (abs)PDFHTML

Papers citing "Resolving the Complexity of Some Fundamental Problems in Computational Social Choice"

1 / 1 papers shown
On the Exact Amount of Missing Information that makes Finding Possible
  Winners Hard
On the Exact Amount of Missing Information that makes Finding Possible Winners Hard
P. Dey
Neeldhara Misra
149
14
0
26 Oct 2016
1
Page 1 of 1