Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretnaya Matematika, 2007, Volume 19, Issue 2, Pages 101–108
DOI: https://doi.org/10.4213/dm25
(Mi dm25)
 

This article is cited in 4 scientific papers (total in 4 papers)

A lower bound for the 4-satisfiability threshold

F. Yu. Vorob'ev
Full-text PDF (112 kB) Citations (4)
References:
Abstract: Let $F_k(n,m)$ be a random $k$-conjunctive normal form obtained by selecting uniformly and independently $m$ out of all possible $k$-clauses on $n$ variables. We prove that if $F_4(n,rn)$ is unsatisfiable with probability tending to one as $n\to\infty$, then $r\ge8.09$. This sharpens the known lower bound $r\ge7.91$.
Received: 15.06.2005
English version:
Discrete Mathematics and Applications, 2007, Volume 17, Issue 3, Pages 287–294
DOI: https://doi.org/10.1515/dma.2007.025
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: F. Yu. Vorob'ev, “A lower bound for the 4-satisfiability threshold”, Diskr. Mat., 19:2 (2007), 101–108; Discrete Math. Appl., 17:3 (2007), 287–294
Citation in format AMSBIB
\Bibitem{Vor07}
\by F.~Yu.~Vorob'ev
\paper A lower bound for the 4-satisfiability threshold
\jour Diskr. Mat.
\yr 2007
\vol 19
\issue 2
\pages 101--108
\mathnet{http://mi.mathnet.ru/dm25}
\crossref{https://doi.org/10.4213/dm25}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2357164}
\zmath{https://zbmath.org/?q=an:05233546}
\elib{https://elibrary.ru/item.asp?id=9577333}
\transl
\jour Discrete Math. Appl.
\yr 2007
\vol 17
\issue 3
\pages 287--294
\crossref{https://doi.org/10.1515/dma.2007.025}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-34547657569}
Linking options:
  • https://www.mathnet.ru/eng/dm25
  • https://doi.org/10.4213/dm25
  • https://www.mathnet.ru/eng/dm/v19/i2/p101
  • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:405
    Full-text PDF :188
    References:37
    First page:4
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024