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, 2009, Volume 21, Issue 1, Pages 139–157
DOI: https://doi.org/10.4213/dm1043
(Mi dm1043)
 

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

New upper bounds for the problem of maximal satisfiability

A. S. Kulikov, K. Kutskov
Full-text PDF (217 kB) Citations (7)
References:
Abstract: In this paper we present relatively simple proofs of the following new upper bounds:
$c^N$, where $c<2$ is a constant and $N$ is the number of variables, for MAX-SAT for formulas with constant clause density;
$2^{K/6}$, where $K$ is the number of clauses, for MAX-2-SAT;
$2^{N/6,7}$ for $(n,3)$-MAX-2-SAT.
All bounds are proved by the splitting method. The main two techniques are combined complexity measures and clause learning.
Received: 11.03.2008
English version:
Discrete Mathematics and Applications, 2009, Volume 19, Issue 2, Pages 155–172
DOI: https://doi.org/10.1515/DMA.2009.009
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: A. S. Kulikov, K. Kutskov, “New upper bounds for the problem of maximal satisfiability”, Diskr. Mat., 21:1 (2009), 139–157; Discrete Math. Appl., 19:2 (2009), 155–172
Citation in format AMSBIB
\Bibitem{KulKut09}
\by A.~S.~Kulikov, K.~Kutskov
\paper New upper bounds for the problem of maximal satisfiability
\jour Diskr. Mat.
\yr 2009
\vol 21
\issue 1
\pages 139--157
\mathnet{http://mi.mathnet.ru/dm1043}
\crossref{https://doi.org/10.4213/dm1043}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2531034}
\elib{https://elibrary.ru/item.asp?id=20730283}
\transl
\jour Discrete Math. Appl.
\yr 2009
\vol 19
\issue 2
\pages 155--172
\crossref{https://doi.org/10.1515/DMA.2009.009}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-67650092015}
Linking options:
  • https://www.mathnet.ru/eng/dm1043
  • https://doi.org/10.4213/dm1043
  • https://www.mathnet.ru/eng/dm/v21/i1/p139
  • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:542
    Full-text PDF :228
    References:43
    First page:13
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024