Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/521
Title: On different models for generating random sat problems
Authors: Janičić, Predrag 
Dedić, Nenad
Terzić, Goran
Affiliations: Informatics and Computer Science 
Keywords: NP-complete problems;Phase transition;SAT problems
Issue Date: 1-Jan-2001
Journal: Computing and Informatics
Abstract: 
In the last decade a lot of effort has been invested into both theoretical and experimental analysis of SAT phase transition. However, a deep theoretical understanding of this phenomenon is still lacking. Besides, many of experimental results are based on some assumptions that are not supported theoretically. In this paper we introduce the notion of SAT-equivalence and we prove that some restrictions often used in SAT experiments don't make an impact on location of a crossover point. We consider several fixed and random clause length SAT models and relations between them. We also discuss one new SAT model and report on a detected phase transition for it.
URI: https://research.matf.bg.ac.rs/handle/123456789/521
ISSN: 13359150
Appears in Collections:Research outputs

Show full item record

Page view(s)

12
checked on Dec 24, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.