Protecting Elections by Recounting Ballots
Authors: Edith Elkind, Jiarui Gan, Svetlana Obraztsova, Zinovi Rabinovich, Alexandros A. Voudouris
IJCAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We provide a detailed analysis of the computational complexity of the algorithmic problems faced by the attacker and the defender. Our main results are summarized in Table 1. |
| Researcher Affiliation | Academia | 1Department of Computer Science, University of Oxford 2School of Computer Science and Engineering, Nanyang Technological University |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks. Algorithms are described in natural language. |
| Open Source Code | No | The paper does not provide concrete access to source code for the methodology described. |
| Open Datasets | No | The paper is theoretical and does not conduct experiments on datasets, thus no information on public dataset availability for training is provided. |
| Dataset Splits | No | The paper is theoretical and does not involve data partitioning or dataset splits for training, validation, or testing. |
| Hardware Specification | No | The paper does not provide specific hardware details for running experiments, as it is a theoretical work. |
| Software Dependencies | No | The paper does not provide specific ancillary software details with version numbers. |
| Experiment Setup | No | The paper does not contain specific experimental setup details, hyperparameters, or training configurations. |