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, 2002, Volume 293, Pages 139–148 (Mi znsl1680)  
This article is cited in 3 scientific papers (total in 3 papers)

Hard satisfiable formulas for DPLL-type algorithms

S. I. Nikolenko

Saint-Petersburg State University
Full-text PDF (209 kB) Citations (3)
Abstract: We address lower bounds on the time complexity of algorithms solving the propositional satisfiability problem. Namely, we consider two DPLL-type algorithms, enhanced with the unit clause and pure literal heuristics. Exponential lower bounds for solving satisfiability on probably satisfiable formulas are proven.
English version:
Journal of Mathematical Sciences (New York), 2005, Volume 126, Issue 3, Pages 1205–1209
DOI: https://doi.org/10.1007/s10958-005-0105-3
Bibliographic databases:
UDC: 510.52+510.633
Language: Russian
Citation: S. I. Nikolenko, “Hard satisfiable formulas for DPLL-type algorithms”, Computational complexity theory. Part VII, Zap. Nauchn. Sem. POMI, 293, POMI, St. Petersburg, 2002, 139–148; J. Math. Sci. (N. Y.), 126:3 (2005), 1205–1209
Citation in format AMSBIB
\Bibitem{Nik02}
\by S.~I.~Nikolenko
\paper Hard satisfiable formulas for DPLL-type algorithms
\inbook Computational complexity theory. Part~VII
\serial Zap. Nauchn. Sem. POMI
\yr 2002
\vol 293
\pages 139--148
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl1680}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1948829}
\zmath{https://zbmath.org/?q=an:1101.68600}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2005
\vol 126
\issue 3
\pages 1205--1209
\crossref{https://doi.org/10.1007/s10958-005-0105-3}
Linking options:
  • https://www.mathnet.ru/eng/znsl1680
  • https://www.mathnet.ru/eng/znsl/v293/p139
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:322
    Full-text PDF :226
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024