RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor
Subscription
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Uspekhi Mat. Nauk:
Year:
Volume:
Issue:
Page:
Find






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


Uspekhi Mat. Nauk, 1989, Volume 44, Issue 3(267), Pages 179–180 (Mi umn2561)  

This article is cited in 6 scientific papers (total in 6 papers)

In the Moscow Mathematical Society
Communications of the Moscow Mathematical Society

The problem of calculating the volume of a polyhedron is enumerably hard

L. G. Khachiyan


Full text: PDF file (165 kB)
References: PDF file   HTML file

English version:
Russian Mathematical Surveys, 1989, 44:3, 199–200

Bibliographic databases:

MSC: 52Bxx, 52C35
Received: 02.11.1987

Citation: L. G. Khachiyan, “The problem of calculating the volume of a polyhedron is enumerably hard”, Uspekhi Mat. Nauk, 44:3(267) (1989), 179–180; Russian Math. Surveys, 44:3 (1989), 199–200

Citation in format AMSBIB
\Bibitem{Kha89}
\by L.~G.~Khachiyan
\paper The problem of calculating the~volume of a~polyhedron is enumerably hard
\jour Uspekhi Mat. Nauk
\yr 1989
\vol 44
\issue 3(267)
\pages 179--180
\mathnet{http://mi.mathnet.ru/umn2561}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1024062}
\zmath{https://zbmath.org/?q=an:0692.68034|0676.68016}
\adsnasa{http://adsabs.harvard.edu/cgi-bin/bib_query?1989RuMaS..44..199K}
\transl
\jour Russian Math. Surveys
\yr 1989
\vol 44
\issue 3
\pages 199--200
\crossref{https://doi.org/10.1070/RM1989v044n03ABEH002136}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=A1989DB71300014}


Linking options:
  • http://mi.mathnet.ru/eng/umn2561
  • http://mi.mathnet.ru/eng/umn/v44/i3/p179

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. B. S. Tsybakov, A. R. Rubinov, “Some Constructions of Conflict-Avoiding Codes”, Problems Inform. Transmission, 38:4 (2002), 268–279  mathnet  crossref  mathscinet  zmath
    2. Arkadi Nemirovski, Alexander Shapiro, “Convex Approximations of Chance Constrained Programs”, SIAM J Optim, 17:4 (2007), 969  crossref  mathscinet  isi
    3. Karl Bringmann, Tobias Friedrich, “Approximating the volume of unions and intersections of high-dimensional geometric objects”, Computational Geometry, 43:6-7 (2010), 601  crossref
    4. Arkadi Nemirovski, “On safe tractable approximations of chance constraints”, European Journal of Operational Research, 2011  crossref
    5. N.G.. Hall, D.Z.huoyu Long, Jin Qi, Melvyn Sim, “Managing Underperformance Risk in Project Portfolio Selection”, Operations Research, 63:3 (2015), 660  crossref
    6. O. V. Khamisov, “Approksimatsiya mery vypuklogo kompaktnogo mnozhestva”, Tr. IMM UrO RAN, 23, no. 3, 2017, 272–279  mathnet  crossref  elib
  • Успехи математических наук Russian Mathematical Surveys
    Number of views:
    This page:559
    Full text:144
    References:19
    First page:2

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019