Fast Algorithms for SAT with Bounded Occurrences of Variables
Authors: Junqiang Peng, Mingyu Xiao
IJCAI 2023 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We present fast algorithms for the general CNF satisfiability problem (SAT) with running-time bound O (cdn)... In this paper, we study exact algorithms for SAT, where one is asked to decide the satisfiability of a given CNF with n variables. In exact algorithms, we are devoted to finding fast algorithms in which the correctness and the worst-case runningtime bound are theoretically guaranteed. |
| Researcher Affiliation | Academia | Junqiang Peng , Mingyu Xiao University of Electronic Science and Technology of China, Chengdu, China jqpeng0@foxmail.com, myxiao@uestc.edu.cn |
| Pseudocode | No | No structured pseudocode or algorithm blocks were found in the paper. |
| Open Source Code | No | The paper does not provide any statement or link indicating that the source code for the described methodology is publicly available. |
| Open Datasets | No | The paper is theoretical and focuses on algorithm complexity bounds, not empirical evaluation on specific datasets. Therefore, no dataset information is provided. |
| Dataset Splits | No | The paper is theoretical and focuses on algorithm complexity bounds, not empirical evaluation on specific datasets. Therefore, no dataset split information is provided. |
| Hardware Specification | No | The paper does not provide any specific hardware details used for running its algorithms or experiments. |
| Software Dependencies | No | The paper does not provide any specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and focuses on algorithm design and complexity, not empirical experiments. Therefore, no experimental setup details like hyperparameters or training configurations are provided. |