On Succinct Encodings for the Tournament Fixing Problem
Authors: Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi
IJCAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we present the first polynomial kernelization for TFP parameterized by the feedback arc set number of the input tournament. We achieve this by providing a polynomial-time routine that computes a SAT encoding where the number of clauses is bounded polynomially in the feedback arc set number. |
| Researcher Affiliation | Academia | Sushmita Gupta1 , Saket Saurabh2,3 , Ramanujan Sridharan4 and Meirav Zehavi5 1National Institute of Science Education and Research (NISER), India 2The Institute of Mathematical Sciences, HBNI, Chennai, India 3University of Bergen, Norway 4University of Warwick, UK 5Ben Gurion University of the Negev, Israel |
| Pseudocode | No | The paper describes the CNF-SAT encoding in words and outlines constraints but does not present structured pseudocode or algorithm blocks. |
| Open Source Code | No | This is a theoretical paper and does not mention releasing source code for the described methodology. |
| Open Datasets | No | This is a theoretical paper and does not describe experiments using datasets for training. |
| Dataset Splits | No | This is a theoretical paper and does not describe experiments using datasets for validation. |
| Hardware Specification | No | This is a theoretical paper and does not describe hardware used for experiments. |
| Software Dependencies | No | This is a theoretical paper and does not describe specific software dependencies with version numbers for experiments. |
| Experiment Setup | No | This is a theoretical paper and does not describe an experimental setup with hyperparameters or training configurations. |