Well-Structured Committees
Authors: Sushmita Gupta, Pallavi Jain, Saket Saurabh
IJCAI 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We study the parameterized complexity of the corresponding combinatorial problems and discuss certain implications of our algorithmic results. |
| Researcher Affiliation | Academia | 1National Institute of Science Education and Research (NISER), HBNI, India 2Ben-Gurion University of the Negev, Israel, 3The Institute of Mathematical Sciences, HBNI, India, 4University of Bergen, Norway |
| Pseudocode | No | The paper describes algorithms (e.g., in the proofs of theorems) but does not provide structured pseudocode blocks or sections labeled "Algorithm". |
| Open Source Code | No | The paper does not mention providing open-source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and does not involve dataset training. No information about public datasets, links, or citations for such use is provided. |
| Dataset Splits | No | The paper is theoretical and does not involve data splits for validation. No information about dataset splits is provided. |
| Hardware Specification | No | The paper is theoretical and does not mention any specific hardware used for computations or experiments. |
| Software Dependencies | No | The paper is theoretical and does not mention any specific software dependencies or their version numbers. |
| Experiment Setup | No | The paper is theoretical and does not describe an experimental setup with hyperparameters or training configurations. |