Solving Integer Quadratic Programming via Explicit and Structural Restrictions
Authors: Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak1477-1484
AAAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | The presented algorithms are exact, deterministic, and complemented by appropriate lower bounds. |
| Researcher Affiliation | Academia | 1Department of Informatics, University of Bergen, Norway 2Algorithms and Complexity group, Vienna University of Technology, Austria 3Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Germany 4Algorithms group, University of Sheffield, UK |
| Pseudocode | No | The paper describes algorithms and their components but does not provide any structured pseudocode blocks or sections labeled 'Algorithm'. |
| Open Source Code | No | The paper does not contain any statement about releasing source code or provide a link to a code repository. |
| Open Datasets | No | The paper is theoretical and focuses on algorithmic complexity and proofs. It does not describe any empirical experiments, data, or dataset splits like training sets. |
| Dataset Splits | No | The paper is theoretical and focuses on algorithmic complexity and proofs. It does not describe any empirical experiments, data, or dataset splits like validation sets. |
| Hardware Specification | No | The paper is theoretical and does not describe any experimental setup or the hardware used to run experiments. |
| Software Dependencies | No | The paper is theoretical and does not describe any experimental setup or list specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and focuses on algorithmic complexity. It does not include details about an experimental setup, such as hyperparameters or system-level training settings. |