학술논문

The impact of heterogeneity and geometry on the proof complexity of random satisfiability.
Document Type
Article
Source
Random Structures & Algorithms; Dec2023, Vol. 63 Issue 4, p885-941, 57p
Subject
NP-complete problems
HETEROGENEITY
POLYNOMIAL time algorithms
GEOMETRY
INDUSTRIAL property
Language
ISSN
10429832
Abstract
Copyright of Random Structures & Algorithms is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)