Trudy Instituta Matematiki i Mekhaniki UrO RAN
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


Trudy Inst. Mat. i Mekh. UrO RAN:
Year:
Volume:
Issue:
Page:
Find




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

Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2013, Volume 19, Number 2, Pages 285–294 (Mi timm954)  
This article is cited in 8 scientific papers (total in 8 papers)

Hybrid method for the approximate solution of the $3$-satisfiability problem associated with the factorization problem

R. T. Faizullina, V. I. Dul'keitb, Yu. Yu. Ogorodnikovc

a Omsk State Technical University
b LuxSoft
c Omsk State University
Full-text PDF (177 kB) Citations (8)
References:
PDF
HTML
Abstract: We consider a hybrid method for the approximate solution of the $3$-satisfiability problem associated with the factorization problem. The method consists of two stages: a segment genetic algorithm and the method of successive approximations. We propose a method for finding most probable bits of the solution. The method consists of several independent tests and makes it possible to approach the convergence domain of the hybrid method and determine several bits of the factors.
Keywords: satisfiability problem, factorization, segment genetic algorithm, minimization.
Received: 10.02.2013
Bibliographic databases:
Document Type: Article
UDC: 004.021
Language: Russian
Citation: R. T. Faizullin, V. I. Dul'keit, Yu. Yu. Ogorodnikov, “Hybrid method for the approximate solution of the $3$-satisfiability problem associated with the factorization problem”, Trudy Inst. Mat. i Mekh. UrO RAN, 19, no. 2, 2013, 285–294
Citation in format AMSBIB
\Bibitem{FaiDulOgo13}
\by R.~T.~Faizullin, V.~I.~Dul'keit, Yu.~Yu.~Ogorodnikov
\paper Hybrid method for the approximate solution of the $3$-satisfiability problem associated with the factorization problem
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2013
\vol 19
\issue 2
\pages 285--294
\mathnet{http://mi.mathnet.ru/timm954}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3364115}
\elib{https://elibrary.ru/item.asp?id=19053991}
Linking options:
  • https://www.mathnet.ru/eng/timm954
  • https://www.mathnet.ru/eng/timm/v19/i2/p285
    • This publication is cited in the following 8 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Trudy Instituta Matematiki i Mekhaniki UrO RAN
    Statistics & downloads:
    Abstract page:400
    Full-text PDF :113
    References:84
    First page:20
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024