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 3(33), Pages 85–92
DOI: https://doi.org/10.17223/20710410/33/7
(Mi pdm550)
 

Mathematical Foundations of Informatics and Programming

About the coNP-complete “Injective knapsack” problem

V. G. Durnev, O. V. Zetkina, A. I. Zetkina, D. M. Murin

P. G. Demidov Yaroslavl State University, Yaroslavl, Russia
References:
Abstract: It is proved that the “Injective knapsack” problem is coNP-complete.
Keywords: NP-complete and coNP-complete problems, injective knapsack, $m$-injective knapsack.
Bibliographic databases:
Document Type: Article
UDC: 512.54
Language: Russian
Citation: V. G. Durnev, O. V. Zetkina, A. I. Zetkina, D. M. Murin, “About the coNP-complete “Injective knapsack” problem”, Prikl. Diskr. Mat., 2016, no. 3(33), 85–92
Citation in format AMSBIB
\Bibitem{DurZetZet16}
\by V.~G.~Durnev, O.~V.~Zetkina, A.~I.~Zetkina, D.~M.~Murin
\paper About the coNP-complete ``Injective knapsack'' problem
\jour Prikl. Diskr. Mat.
\yr 2016
\issue 3(33)
\pages 85--92
\mathnet{http://mi.mathnet.ru/pdm550}
\crossref{https://doi.org/10.17223/20710410/33/7}
Linking options:
  • https://www.mathnet.ru/eng/pdm550
  • https://www.mathnet.ru/eng/pdm/y2016/i3/p85
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:250
    Full-text PDF :83
    References:41
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024