Matematicheskie Trudy
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


Mat. Tr.:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Trudy, 2006, Volume 9, Number 1, Pages 117–129 (Mi mt41)  
NP-Completeness of the Dictionary Generation Problem

V. Yu. Popov

Ural State University
Full-text PDF (1088 kB)
References:
PDF
HTML
Abstract: We prove that the Dictionary Generation Problem is NP-complete and consider the parametrized complexity of this problem.
Key words: dictionary generation, NP-completeness, parametrized complexity.
Received: 30.11.2004
Bibliographic databases:
UDC: 512+519.4
Language: Russian
Citation: V. Yu. Popov, “NP-Completeness of the Dictionary Generation Problem”, Mat. Tr., 9:1 (2006), 117–129; Siberian Adv. Math., 16:3 (2006), 115–125
Citation in format AMSBIB
\Bibitem{Pop06}
\by V.~Yu.~Popov
\paper NP-Completeness of the~Dictionary Generation Problem
\jour Mat. Tr.
\yr 2006
\vol 9
\issue 1
\pages 117--129
\mathnet{http://mi.mathnet.ru/mt41}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2251333}
\transl
\jour Siberian Adv. Math.
\yr 2006
\vol 16
\issue 3
\pages 115--125
Linking options:
  • https://www.mathnet.ru/eng/mt41
  • https://www.mathnet.ru/eng/mt/v9/i1/p117
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические труды Siberian Advances in Mathematics
    Statistics & downloads:
    Abstract page:352
    Full-text PDF :143
    References:46
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024