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



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






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


Prikl. Diskr. Mat., 2013, Number 4(22), Pages 56–66 (Mi pdm429)  

Computational Methods in Discrete Mathematics

On the asymptotic solution of a special type recurrence relations and the Kullmann–Luckhardt's technology

V. V. Bykova

Institute of Mathematics and Computer Science, Siberian Federal University, Krasnoyarsk, Russia

Abstract: The problem of solving recurrence relations that arise in the analysis of the computational complexity of recursive algorithms is discussed. The research is only related to splitting algorithms, namely, DPLL-algorithms, which are named after the author's names by the first letters (Davis, Putman, Logemann, Loveland), and are designed to solve the problem SAT. The technology by Kullmann–Luckhardt, which is traditionally used in the analysis of the computational complexity of splitting algorithms, is explored. A theorem containing an upper estimate for the algorithm time is proved in the case of balanced splitting. The theorem extends the capabilities of the Kullmann–Luckhardt's technology.

Keywords: computational complexity of recursive algorithms, splitting algorithms, solving recurrence relations.

Full text: PDF file (624 kB)
References: PDF file   HTML file
UDC: 519.712

Citation: V. V. Bykova, “On the asymptotic solution of a special type recurrence relations and the Kullmann–Luckhardt's technology”, Prikl. Diskr. Mat., 2013, no. 4(22), 56–66

Citation in format AMSBIB
\Bibitem{Byk13}
\by V.~V.~Bykova
\paper On the asymptotic solution of a~special type recurrence relations and the Kullmann--Luckhardt's technology
\jour Prikl. Diskr. Mat.
\yr 2013
\issue 4(22)
\pages 56--66
\mathnet{http://mi.mathnet.ru/pdm429}


Linking options:
  • http://mi.mathnet.ru/eng/pdm429
  • http://mi.mathnet.ru/eng/pdm/y2013/i4/p56

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Прикладная дискретная математика
    Number of views:
    This page:327
    Full text:105
    References:42
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021