A graph mapping encodes obstacles to single-crossing elections, enabling complexity analysis of near-single-crossing detection problems.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Single-crossing Implementation
A graph mapping encodes obstacles to single-crossing elections, enabling complexity analysis of near-single-crossing detection problems.