Loading [MathJax]/jax/output/SVG/config.js
Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

Prikladnaya Diskretnaya Matematika. Supplement, 2013, Issue 6, Pages 112–116 (Mi pdma76)  
Computational methods in discrete mathematics

Asymptotic solution of the recurrence relations in the analysis of splitting algorithms for SAT

V. V. Bykova

Institute of Mathematics and Computer Science, Siberian Federal University, Krasnoyarsk
Full-text PDF (613 kB)
References:
PDF
HTML
Abstract: The traditional technique for analysis of splitting algorithms for SAT problem is considered. A theorem establishing the upper bounds for execution time of algorithms in the case of balanced splitting is offered.
Keywords: splitting algorithms, computational complexity.
Document Type: Article
UDC: 519.712
Language: Russian
Citation: V. V. Bykova, “Asymptotic solution of the recurrence relations in the analysis of splitting algorithms for SAT”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 112–116
Citation in format AMSBIB
\Bibitem{Byk13}
\by V.~V.~Bykova
\paper Asymptotic solution of the recurrence relations in the analysis of splitting algorithms for SAT
\jour Prikl. Diskr. Mat. Suppl.
\yr 2013
\issue 6
\pages 112--116
\mathnet{http://mi.mathnet.ru/pdma76}
Linking options:
  • https://www.mathnet.ru/eng/pdma76
  • https://www.mathnet.ru/eng/pdma/y2013/i6/p112
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:192
    Full-text PDF :116
    References:54
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025