Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/521
DC FieldValueLanguage
dc.contributor.authorJaničić, Predragen_US
dc.contributor.authorDedić, Nenaden_US
dc.contributor.authorTerzić, Goranen_US
dc.date.accessioned2022-08-13T10:14:43Z-
dc.date.available2022-08-13T10:14:43Z-
dc.date.issued2001-01-01-
dc.identifier.issn13359150en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/521-
dc.description.abstractIn 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.en
dc.relation.ispartofComputing and Informaticsen
dc.subjectNP-complete problemsen
dc.subjectPhase transitionen
dc.subjectSAT problemsen
dc.titleOn different models for generating random sat problemsen_US
dc.typeArticleen_US
dc.identifier.scopus2-s2.0-0345772957-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/0345772957-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.firstpage451en
dc.relation.lastpage469en
dc.relation.volume20en
dc.relation.issue5en
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0001-8922-4948-
Appears in Collections:Research outputs
Show simple item record

Page view(s)

12
checked on Dec 25, 2024

Google ScholarTM

Check


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