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


Prikl. Diskr. Mat., 2016, Number 2(32), Pages 119–126 (Mi pdm547)  

This article is cited in 3 scientific papers (total in 3 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

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


DOI: https://doi.org/10.17223/20710410/32/9

Full text: PDF file (638 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 510.52

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:
  • http://mi.mathnet.ru/eng/pdm547
  • http://mi.mathnet.ru/eng/pdm/y2016/i2/p119

    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

    This publication is cited in the following articles:
    1. A. N. Rybalov, “O genericheskoi NP-polnote problemy vypolnimosti bulevykh formul”, PDM, 2017, no. 36, 106–112  mathnet  crossref
    2. A. N. Rybalov, “O genericheskoi slozhnosti problemy klasterizatsii grafov”, PDM, 2019, no. 46, 72–77  mathnet  crossref
    3. A. N. Rybalov, “O genericheskoi slozhnosti ekzistentsialnykh teorii”, PDM, 2020, no. 49, 120–126  mathnet  crossref
  • Прикладная дискретная математика
    Number of views:
    This page:102
    Full text:34
    References:20

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