Skip to main content
SpringerLink
Log in

Binary representation of underdetermined data

  • Computer Science
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. L. A. Sholomov, Prikl. Diskret. Mat. Prilozh., No. 2, 18–42 (2009).

    Google Scholar 

  2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir, Moscow, 1982).

    MATH  Google Scholar 

  3. A. A. Sapozhenko, A. S. Asratyan, and N. N. Kuzyurin, in Discrete Analysis Methods in the Solution of Combinatorial Problems (Inst. Mat. Sib. Otd. Akad. Nauk SSSR, Novosibirsk, 1977), No. 30, pp. 46–75 [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of System Analysis, Russian Academy of Sciences, pr. 60-letiya Oktyabrya 9, Moscow, 117312, Russia

    L. A. Sholomov

Authors
  1. L. A. Sholomov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. A. Sholomov.

Additional information

Original Russian Text © L.A. Sholomov, 2013, published in Doklady Akademii Nauk, 2013, Vol. 448, No. 3, pp. 275–278.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sholomov, L.A. Binary representation of underdetermined data. Dokl. Math. 87, 116–119 (2013). https://doi.org/10.1134/S1064562413010201

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064562413010201

Keywords

Search

Navigation