On the Complexity of mCP-nets
Authors: Thomas Lukasiewicz, Enrico Malizia
AAAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we start to fill this gap by carrying out a precise computational complexity analysis of voting tasks on acyclic binary polynomially connected m CP-nets whose constituents are standard CP-nets. |
| Researcher Affiliation | Academia | Thomas Lukasiewicz and Enrico Malizia Department of Computer Science, University of Oxford, UK firstname.lastname@cs.ox.ac.uk |
| Pseudocode | No | The paper describes conceptual algorithms and complexity analysis but does not provide any structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper is theoretical and does not mention releasing any source code for its methodology. |
| Open Datasets | No | This is a theoretical paper focusing on computational complexity analysis; it does not utilize or provide access to datasets for training or evaluation. |
| Dataset Splits | No | This is a theoretical paper; it does not describe experimental validation with dataset splits. |
| Hardware Specification | No | This is a theoretical paper on computational complexity; no specific hardware used for experiments is mentioned. |
| Software Dependencies | No | This is a theoretical paper; no specific software dependencies with version numbers are mentioned. |
| Experiment Setup | No | This is a theoretical paper on computational complexity; it does not describe any experimental setup details or hyperparameters. |