Doklady Akademii Nauk SSSR
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


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




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

Doklady Akademii Nauk SSSR, 1986, Volume 290, Number 2, Pages 281–286 (Mi dan8446)  
MATHEMATICS

Quasipolynomial algorithms for the recognition of the satisfiability and derivability of propositional formulas

M. I. Kanovich

Kalininsky State University
Full-text PDF (842 kB)
Presented: A. N. Kolmogorov
Received: 22.05.1985
Bibliographic databases:
Document Type: Article
UDC: 517.11
Language: Russian
Citation: M. I. Kanovich, “Quasipolynomial algorithms for the recognition of the satisfiability and derivability of propositional formulas”, Dokl. Akad. Nauk SSSR, 290:2 (1986), 281–286
Citation in format AMSBIB
\Bibitem{Kan86}
\by M.~I.~Kanovich
\paper Quasipolynomial algorithms for the recognition of the satisfiability and derivability of propositional formulas
\jour Dokl. Akad. Nauk SSSR
\yr 1986
\vol 290
\issue 2
\pages 281--286
\mathnet{http://mi.mathnet.ru/dan8446}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=859282}
\zmath{https://zbmath.org/?q=an:0629.03013}
Linking options:
  • https://www.mathnet.ru/eng/dan8446
  • https://www.mathnet.ru/eng/dan/v290/i2/p281
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024