Computational complexity characterization of protecting elections from bribery

DOI10.1007/978-3-030-58150-3_7OpenAlexW3081972775MaRDI QIDQ5918250

Weidong (Larry) Shi, Nolan Shah, Lin Chen, Yang Lu, Ahmed Sunny, Shouhuai Xu, Zhi Min Gao

Publication date: 21 April 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.02533

zbMATH Keywords

complexityvotingNP-hardness\(\varSigma_2^p\)-hardness

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

This page was built for publication: Computational complexity characterization of protecting elections from bribery