2021•Theoretical Computer ScienceOpen access

Computational complexity characterization of protecting elections from bribery

Lin Chen, Ahmed Imtiaz Sunny, Lei Xu, Shouhuai Xu, Zhimin Gao, Yang Lü, Weidong Larry Shi, Nolan Shah

Open full text 1 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Computational complexity theory, Time complexity, Computer science, Characterization (materials science), Decision problem, Ask price, Computer security, Law and economics

Back to paper search Browse research topics Original source

Computational complexity characterization of protecting elections from bribery — Research Paper | ScholarLens