On the Satisfiability Threshold of Random Community-Structured SAT
Authors: Dina Barak-Pelleg, Daniel Berend
IJCAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we endeavor to study the satisfiability threshold for random industrial SAT. ... Our main result is that the threshold of random community-structured SAT tends to be smaller than its counterpart for random SAT. Moreover, under some conditions, this threshold even vanishes. ... The main results are stated in Section 3, and the proofs follow in Section 4. |
| Researcher Affiliation | Academia | Dina Barak-Pelleg1 and Daniel Berend2 1 Department of Math, Ben-Gurion University of the Negev, Beer Sheva, Israel 2 Departments of Math and of Computer Science, Ben-Gurion University of the Negev, Beer Sheva, Israel |
| Pseudocode | No | The paper focuses on theoretical proofs and mathematical derivations. It does not include any pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not mention providing open-source code for the methodology described. |
| Open Datasets | No | The paper is theoretical, focusing on the satisfiability threshold of a random SAT model. It does not describe any empirical training processes or the use of publicly available datasets for training. |
| Dataset Splits | No | The paper is theoretical and does not involve experimental validation with data splits. |
| Hardware Specification | No | The paper is theoretical and does not describe any experimental setup that would require hardware specifications. |
| Software Dependencies | No | The paper is theoretical and does not list any specific software dependencies with version numbers for experimental reproducibility. |
| Experiment Setup | No | The paper is theoretical and focuses on mathematical proofs and analyses of a SAT model. It does not describe an experimental setup with hyperparameters or system-level training settings. |