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


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




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

Diskretnaya Matematika, 1995, Volume 7, Issue 1, Pages 19–51 (Mi dm560)  
On the complexity of the realization of Boolean matrices with a connected boundary

I. R. Khaverlik
Full-text PDF (3142 kB)
Received: 01.12.1992
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: I. R. Khaverlik, “On the complexity of the realization of Boolean matrices with a connected boundary”, Diskr. Mat., 7:1 (1995), 19–51; Discrete Math. Appl., 5:1 (1995), 1–29
Citation in format AMSBIB
\Bibitem{Kha95}
\by I.~R.~Khaverlik
\paper On the complexity of the realization of Boolean matrices with a connected boundary
\jour Diskr. Mat.
\yr 1995
\vol 7
\issue 1
\pages 19--51
\mathnet{http://mi.mathnet.ru/dm560}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1331929}
\zmath{https://zbmath.org/?q=an:0836.68082}
\transl
\jour Discrete Math. Appl.
\yr 1995
\vol 5
\issue 1
\pages 1--29
Linking options:
  • https://www.mathnet.ru/eng/dm560
  • https://www.mathnet.ru/eng/dm/v7/i1/p19
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:222
    Full-text PDF :81
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024