Extremal Separation Problems for Temporal Instance Queries
Authors: Jean Christoph Jung, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev
IJCAI 2024 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Our results range from tight complexity bounds for verifying and counting extremal separators to algorithms computing them. |
| Researcher Affiliation | Academia | 1Department of Computer Science, TU Dortmund University, Germany 2School of Computing and Mathematical Sciences, Birkbeck, University of London, UK 3Department of Computer Science, University of Liverpool, UK |
| Pseudocode | No | The paper describes algorithms and methods in prose (e.g., in Section 7 'Algorithms') but does not contain explicitly structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not contain an explicit statement about the release of source code for the described methodology, nor does it provide a link to a code repository. |
| Open Datasets | No | The paper uses illustrative data examples (e.g., Example 1, Example 6) for theoretical demonstration, but does not use or provide access to publicly available datasets for experimental evaluation. |
| Dataset Splits | No | The paper focuses on theoretical analysis and does not describe experimental validation with dataset splits (training, validation, or test sets). |
| Hardware Specification | No | The paper focuses on theoretical analysis and algorithm design and does not provide any specific hardware specifications used for experiments. |
| Software Dependencies | No | The paper does not specify any software dependencies with version numbers, as it is a theoretical work focused on complexity analysis and algorithms rather than implementation. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup details such as hyperparameters or system-level training settings. |