Complexity Results for Compressing Optimal Paths
Authors: Adi Botea, Ben Strasser, Daniel Harabor
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Our results give a first theoretical underpinning to the problem of creating space-efficient CPDs using RLE. |
| Researcher Affiliation | Collaboration | Adi Botea IBM Research Ireland Ben Strasser Karlsruhe Institute of Technology Germany Daniel Harabor NICTA Australia |
| Pseudocode | No | No pseudocode or algorithm blocks were found in the paper. |
| Open Source Code | No | The paper is theoretical and does not mention any release of source code. |
| Open Datasets | No | The paper is theoretical and does not involve datasets or training. |
| Dataset Splits | No | The paper is theoretical and does not involve datasets or validation splits. |
| Hardware Specification | No | The paper is theoretical and does not describe any hardware used for experiments. |
| Software Dependencies | No | The paper is theoretical and does not specify software dependencies with version numbers for experimental reproducibility. |
| Experiment Setup | No | The paper is theoretical and does not describe experimental setup details or hyperparameters. |