Prikladnaya Diskretnaya Matematika
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

Prikladnaya Diskretnaya Matematika, 2016, Number 2(32), Pages 119–126
DOI: https://doi.org/10.17223/20710410/32/9 (Mi pdm547) 		 
This article is cited in 6 scientific papers (total in 6 papers)

Mathematical Foundations of Informatics and Programming

On generic complexity of the validity problem for Boolean formulas

A. N. Rybalov

Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia
Full-text PDF (638 kB) Citations (6)
References:
PDF
HTML
DOI: https://doi.org/10.17223/20710410/32/9
Abstract: Generic-case approach to algorithmic problems was suggested by Miasnikov, Kapovich, Schupp and Shpilrain in 2003. This approach studies behavior of an algorithm on typical (almost all) inputs and ignores the rest of inputs. In this paper, we consider generic complexity of the validity problem for Boolean formulas and prove that this problem is generically hard if it is hard in the worst case.
Keywords: generic complexity, validity problem for Boolean formulas.
Funding agency Grant number
Russian Foundation for Basic Research 16-01-00577
Bibliographic databases:
Document Type: Article
UDC: 510.52
Language: Russian
Citation: A. N. Rybalov, “On generic complexity of the validity problem for Boolean formulas”, Prikl. Diskr. Mat., 2016, no. 2(32), 119–126
Citation in format AMSBIB
\Bibitem{Ryb16}
\by A.~N.~Rybalov
\paper On generic complexity of the validity problem for Boolean formulas
\jour Prikl. Diskr. Mat.
\yr 2016
\issue 2(32)
\pages 119--126
\mathnet{http://mi.mathnet.ru/pdm547}
\crossref{https://doi.org/10.17223/20710410/32/9}
Linking options:
  • https://www.mathnet.ru/eng/pdm547
  • https://www.mathnet.ru/eng/pdm/y2016/i2/p119
    • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:207
    Full-text PDF :57
    References:35
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024