{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:12:51Z","timestamp":1774365171421,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,2,16]],"date-time":"2016-02-16T00:00:00Z","timestamp":1455580800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Russian Foundation for Basic Research"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s00373-016-1683-1","type":"journal-article","created":{"date-parts":[[2016,2,16]],"date-time":"2016-02-16T02:40:00Z","timestamp":1455590400000},"page":"1789-1803","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Number of Irreducible Points in Polyhedra"],"prefix":"10.1007","volume":"32","author":[{"given":"Aleksandr Yu.","family":"Chirkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4542-9233","authenticated-orcid":false,"given":"Nikolai Yu.","family":"Zolotykh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,16]]},"reference":[{"key":"1683_CR1","doi-asserted-by":"crossref","unstructured":"Alekseyev, M.A., Basova, M., Zolotykh, N.Yu.: On the minimal teaching sets of two-dimensional threshold functions. SIAM J. Discrete Math. 29(1), 157\u2013165 (2015)","DOI":"10.1137\/140978090"},{"issue":"1","key":"1683_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(94)00007-Z","volume":"61","author":"M Antony","year":"1995","unstructured":"Antony, M., Brightwell, G., Shawe-Taylor, J.: On exact specification by labelled examples. Discrete Appl. Math. 61(1), 1\u201325 (1995)","journal-title":"Discrete Appl. Math."},{"key":"1683_CR3","first-page":"319","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Discrete Appl. Math. 2, 319\u2013342 (1988)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"1683_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01204716","volume":"12","author":"I B\u00e1r\u00e1ny","year":"1992","unstructured":"B\u00e1r\u00e1ny, I., Howe, R., Lov\u00e1sz, L.: On integer points in polyhedra: a lower bound. Combinatorica 12(2), 135\u2013142 (1992)","journal-title":"Combinatorica"},{"key":"1683_CR5","unstructured":"Chirkov, A.Yu.: Caratheodory\u2019s theorem and coverings of a polyhedron by simplexes. Manuscript No. 668B93, deposited at VINITI, Moscow, (1993). (in Russian)"},{"key":"1683_CR6","unstructured":"Chirkov, A.Yu.: On the lower bound for the number of vertices of convex hull of integer and partially integer points of a polyhedron. Discrete Anal. Oper. Res. 3(2), 80\u201389 (1996)"},{"key":"1683_CR7","unstructured":"Chirkov, A.Yu.: The relationship between upper bounds of the number of vertices of convex hull of integer points of a polyhedron and its metric characteristics. In: Proceedings of the First International Conference on Mathematical Algorithms, pp. 169\u2013174. Nizhni Novgorod State University Publisher (1997). (in Russian)"},{"issue":"1","key":"1683_CR8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01191202","volume":"12","author":"W Cook","year":"1992","unstructured":"Cook, W., Hartmann, M., Kannan, R., McDiarmid, C.: On integer points in polyhedra. Combinatorica 12(1), 27\u201337 (1992)","journal-title":"Combinatorica"},{"issue":"3","key":"1683_CR9","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1137\/S0895480192235878","volume":"7","author":"J H\u00e5stad","year":"1994","unstructured":"H\u00e5stad, J.: On the size of weights for threshold gates. SIAM J. Discrete Math. 7(3), 484\u2013492 (1994)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1683_CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0166-218X(83)90067-7","volume":"6","author":"AS Hayes","year":"1983","unstructured":"Hayes, A.S., Larman, D.C.: The vertices of the knapsack polytope. Discrete Appl. Math. 6(2), 135\u2013138 (1983)","journal-title":"Discrete Appl. Math."},{"key":"1683_CR11","doi-asserted-by":"crossref","unstructured":"Heged\u00fcs, T.: Geometrical concept learning and convex polytopes. In: Proceedings of the 7th Annual ACM Conference on Computational Learning Theory (COLT\u201994) pp. 228\u2013236. New York, ACM Press (1994)","DOI":"10.1145\/180139.181124"},{"key":"1683_CR12","doi-asserted-by":"crossref","unstructured":"Heged\u00fcs, T.: Generalized teaching dimensions and the query complexity of learning. In: Proceedings of the 8th Annual ACM Conference on Computational Learning Theory (COLT\u201995) pp. 108\u2013117. New York, ACM Press (1995)","DOI":"10.1145\/225298.225311"},{"key":"1683_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1991","unstructured":"McMullen, P.: The maximum number of faces of a convex polytope. Mathematika 17, 179\u2013184 (1991)","journal-title":"Mathematika"},{"issue":"2","key":"1683_CR14","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1112\/S0025579300006665","volume":"38","author":"DA Morgan","year":"1991","unstructured":"Morgan, D.A.: Upper and lower bound results on the convex hull of integer points in polyhedra. Mathematika 38(2), 321\u2013328 (1991)","journal-title":"Mathematika"},{"key":"1683_CR15","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience, New York (1986)"},{"key":"1683_CR16","first-page":"133","volume":"2","author":"VN Shevchenko","year":"1981","unstructured":"Shevchenko, V.N.: On the number of extreme points in integer programming. Kibernetika 2, 133\u2013134 (1981)","journal-title":"Kibernetika"},{"key":"1683_CR17","unstructured":"Shevchenko, V.N., Zolotykh, N.Yu.: On complexity of deciphering threshold functions of $$k$$ k -valued logic. Russ. Math. Dokl. 362(5), 606\u2013608 (1998)"},{"key":"1683_CR18","unstructured":"Veselov, S.I.: A lower bound for the mean number of irreducible and extreme points in two discrete programming problems. Manuscript 61984, deposited at VINITI, Moscow (1984). (in Russian)"},{"key":"1683_CR19","doi-asserted-by":"crossref","unstructured":"Veselov, S.I., Chirkov, A.Yu.: Some estimates for the number of vertices of integer polyhedra. J. Appl. Ind. Math. 2(4), 591\u2013604 (2008)","DOI":"10.1134\/S1990478908040157"},{"key":"1683_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"GM Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Springer, Berlin (1995)"},{"key":"1683_CR21","unstructured":"Zolotykh, N.Yu.: On the number of vertices in integer linear programming problems. arXiv:math\/0611356 [math.CO] (2006)"},{"key":"1683_CR22","unstructured":"Zolotykh, N.Yu., Chirkov, A.Y.: On the upper bound for cardinality of the minimal teaching set of a threshold function. Discrete Anal. Oper. Res. 19(5), 35\u201346 (2012). (in Russian)"},{"key":"1683_CR23","unstructured":"Zolotykh, N.Yu., Shevchenko, V.N.: On complexity of deciphering threshold functions. Discrete Anal. Oper. Res. 2(3), 72\u201373 (1995). (in Russian)"},{"key":"1683_CR24","unstructured":"Zolotykh, N.Yu., Shevchenko, V.N.: Estimating the complexity of deciphering a threshold functions in a $$k$$ k -valued logic. Comput. Math. Math. Phys. 39(2), 328\u2013334 (1999)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1683-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1683-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1683-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T13:19:31Z","timestamp":1589635171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1683-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,16]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["1683"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1683-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,16]]}}}