Computational Complexity Characterization of Protecting Elections from Bribery (Journal Article) | NSF PAGES

skip to main content

Citation Details

Computational Complexity Characterization of Protecting Elections from Bribery

Award ID(s):: 2004096

NSF-PAR ID:: 10294467

Author(s) / Creator(s):: Chen, Lin; Sunny, Ahmed Imtiaz; Xu, Lei; Xu, Shouhuai; Gao, Zhimin; Lu, Yang; Shi, Weidong; Shah, Nolan

Date Published:: 2021-09-01

Journal Name:: Theoretical Computer Science

ISSN:: 0304-3975

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Journal Article:
https://doi.org/10.1016/j.tcs.2021.08.036