Zapiski Nauchnykh Seminarov POMI
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


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




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

Zapiski Nauchnykh Seminarov POMI, 2001, Volume 277, Pages 14–46 (Mi znsl1427)  
This article is cited in 12 scientific papers (total in 12 papers)

Algorithms for SAT and upper bounds on their complexity

M. A. Vsemirnov, E. A. Hirsch, E. Ya. Dantsin, S. V. Ivanov

St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences
Full-text PDF (353 kB) Citations (12)
Abstract: We survey recent algorithms for the propositional satisfiability problem, in particular algorithms that have the best current worst-case upper bounds on their complexity. We also discuss some related issues: the derandomization of the algorithm of Paturi, Pudlák, Saks and Zane, the Valiant-Vazirani Lemma, and random walk algorithms with the “back button”.
Received: 15.01.2001
English version:
Journal of Mathematical Sciences (New York), 2003, Volume 118, Issue 2, Pages 4948–4962
DOI: https://doi.org/10.1023/A:1025645221773
Bibliographic databases:
UDC: 510.52
Language: Russian
Citation: M. A. Vsemirnov, E. A. Hirsch, E. Ya. Dantsin, S. V. Ivanov, “Algorithms for SAT and upper bounds on their complexity”, Computational complexity theory. Part VI, Zap. Nauchn. Sem. POMI, 277, POMI, St. Petersburg, 2001, 14–46; J. Math. Sci. (N. Y.), 118:2 (2003), 4948–4962
Citation in format AMSBIB
\Bibitem{VseHirDan01}
\by M.~A.~Vsemirnov, E.~A.~Hirsch, E.~Ya.~Dantsin, S.~V.~Ivanov
\paper Algorithms for SAT and upper bounds on their complexity
\inbook Computational complexity theory. Part~VI
\serial Zap. Nauchn. Sem. POMI
\yr 2001
\vol 277
\pages 14--46
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl1427}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1865895}
\zmath{https://zbmath.org/?q=an:1074.68577}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2003
\vol 118
\issue 2
\pages 4948--4962
\crossref{https://doi.org/10.1023/A:1025645221773}
Linking options:
  • https://www.mathnet.ru/eng/znsl1427
  • https://www.mathnet.ru/eng/znsl/v277/p14
    • This publication is cited in the following 12 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:591
    Full-text PDF :305
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024