{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:04:05Z","timestamp":1773230645368,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4064,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0304-3975(02)00023-3","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T18:41:59Z","timestamp":1034275319000},"page":"455-469","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"title":["On the algorithmic inversion of the discrete Radon transform"],"prefix":"10.1016","volume":"281","author":[{"given":"Peter","family":"Gritzmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"de Vries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00023-3_BIB1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0024-3795(01)00437-2","article-title":"On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional X-rays","volume":"339","author":"Brunetti","year":"2001","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0304-3975(02)00023-3_BIB2","first-page":"13","article-title":"On the reconstruction of permutation and partition sets under tomographic constraints","author":"Brunetti","year":"2001","journal-title":"Manuscript"},{"issue":"1","key":"10.1016\/S0304-3975(02)00023-3_BIB3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/362452.362471","article-title":"The reconstruction of binary patterns from their projections","volume":"14","author":"Chang","year":"1971","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/S0304-3975(02)00023-3_BIB4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0166-218X(96)00083-2","article-title":"The discrete Radon transform and its approximate inversion via linear programming","volume":"75","author":"Fishburn","year":"1997","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/S0304-3975(02)00023-3_BIB5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0012-365X(91)90106-C","article-title":"Sets uniquely determined by projections on axes II: Discrete case","volume":"91","author":"Fishburn","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(02)00023-3_BIB6","series-title":"Discrete Tomography: Foundations, Algorithms, Applications","first-page":"85","article-title":"Uniqueness and complexity in discrete tomography","author":"Gardner","year":"1999"},{"key":"10.1016\/S0304-3975(02)00023-3_BIB7","doi-asserted-by":"crossref","unstructured":"R.J. Gardner, P. Gritzmann, D. Prangenberg, in: R.A. Melter, A.Y. Wu, L. Latecki (Eds.), On the Reconstruction of Binary Images from their Discrete Radon Transforms, Vision Geometry V, Society of Photo-Optical Instrumentation Engineers Proceedings, Vol. 2826, 1996, pp. 121\u2013132.","DOI":"10.1117\/12.251785"},{"key":"10.1016\/S0304-3975(02)00023-3_BIB8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0012-365X(98)00347-1","article-title":"On the computational complexity of reconstructing lattice sets from their X-rays","volume":"202","author":"Gardner","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(02)00023-3_BIB9","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(02)00023-3_BIB10","series-title":"Proc. 7th Internat. Workshop, DGCI \u201997, Montpellier, France","first-page":"19","article-title":"On the reconstruction of finite lattice sets from their X-rays","volume":"Vol. 1347","author":"Gritzmann","year":"1997"},{"key":"10.1016\/S0304-3975(02)00023-3_BIB11","doi-asserted-by":"crossref","unstructured":"P. Gritzmann, S. de Vries, Reconstructing crystalline structures from few images under high resolution transmission electron microscopy, in: W. J\u00e4ger (Ed.), Mathematics: Key Technology for the Future, Springer, 2002, in print.","DOI":"10.1007\/978-3-642-55753-8_36"},{"key":"10.1016\/S0304-3975(02)00023-3_BIB12","series-title":"Discrete Tomography: Foundations, Algorithms, and Applications","year":"1999"},{"key":"10.1016\/S0304-3975(02)00023-3_BIB13","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/S0097539790191010","article-title":"Three-dimensional statistical data security problems","volume":"23","author":"Irving","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00023-3_BIB14","first-page":"69","article-title":"A catalog of complexity classes","volume":"Vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/S0304-3975(02)00023-3_BIB15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","article-title":"Combinatorial properties of matrices of zeros and ones","volume":"9","author":"Ryser","year":"1957","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0304-3975(02)00023-3_BIB16","doi-asserted-by":"crossref","unstructured":"H.J. Ryser, Combinatorial Mathematics, Mathematical Association of America and Quinn & Boden, Rahway, NJ, 1963.","DOI":"10.5948\/UPO9781614440147"},{"key":"10.1016\/S0304-3975(02)00023-3_BIB17","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0146-664X(82)90097-1","article-title":"A network flow approach to reconstruction of the left ventricle from two projections","volume":"18","author":"Slump","year":"1982","journal-title":"Comput. Graphics Image Process."},{"issue":"2","key":"10.1016\/S0304-3975(02)00023-3_BIB18","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","article-title":"A strongly polynomial algorithm to solve combinatorial linear programs","volume":"34","author":"Tardos","year":"1986","journal-title":"Operations Research"},{"key":"10.1016\/S0304-3975(02)00023-3_BIB19","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1006\/jabr.1998.7496","article-title":"Sets of uniqueness and minimal matrices","volume":"208","author":"Torres-Ch\u00e1zaro","year":"1998","journal-title":"J. Algebra"},{"key":"10.1016\/S0304-3975(02)00023-3_BIB20","unstructured":"M. Wiegelmann, Gr\u00f6bner bases and primal algorithms in discrete tomography, Ph.D. thesis, Technische Universit\u00e4t M\u00fcnchen, 1998."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:15Z","timestamp":1759625535000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0304397502000233"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00023-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the algorithmic inversion of the discrete Radon transform","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(02)00023-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}