Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

Matematicheskie Zametki, 1998, Volume 64, Issue 1, Pages 9–16
DOI: https://doi.org/10.4213/mzm1367 (Mi mzm1367) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Recursively compressible sets

V. K. Bulitko

I. I. Mechnikov Odessa National University
Full-text PDF (218 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mzm1367
Abstract: Classes of recursively compressible and incompressible sets as well as some other classes emerging in connection with a simple recursive-theory model of data array packing are studied. Some new completeness criteria for sets are obtained.
Received: 14.08.1996
Revised: 10.06.1997
English version:
Mathematical Notes, 1998, Volume 64, Issue 1, Pages 8–14
DOI: https://doi.org/10.1007/BF02307190
Bibliographic databases:
UDC: 517.1
Language: Russian
Citation: V. K. Bulitko, “Recursively compressible sets”, Mat. Zametki, 64:1 (1998), 9–16; Math. Notes, 64:1 (1998), 8–14
Citation in format AMSBIB
\Bibitem{Bul98}
\by V.~K.~Bulitko
\paper Recursively compressible sets
\jour Mat. Zametki
\yr 1998
\vol 64
\issue 1
\pages 9--16
\mathnet{http://mi.mathnet.ru/mzm1367}
\crossref{https://doi.org/10.4213/mzm1367}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1694018}
\zmath{https://zbmath.org/?q=an:0919.03038}
\transl
\jour Math. Notes
\yr 1998
\vol 64
\issue 1
\pages 8--14
\crossref{https://doi.org/10.1007/BF02307190}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000078147600002}
Linking options:
  • https://www.mathnet.ru/eng/mzm1367
  • https://doi.org/10.4213/mzm1367
  • https://www.mathnet.ru/eng/mzm/v64/i1/p9
    • This publication is cited in the following 1 articles:
    1. V. N. Belyaev, V. K. Bulitko, “m-Reducibility with Upper and Lower Bounds for the Reducing Functions”, Math. Notes, 70:1 (2001), 11–19  mathnet  crossref  crossref  mathscinet  zmath  isi
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:434
    Full-text PDF :187
    References:73
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025