UnivTrevesV1, Main, Exploration, bibRecordById, ISTEX:C46DED77C24E5612284A1BB494E45C8BD493A9FA

On the computational complexity of determining polyatomic structures by X-rays

Identifieur interne : 001F24 ( Main/Exploration ); précédent : 001F23; suivant : 001F25

On the computational complexity of determining polyatomic structures by X-rays

Auteurs : R. J. Gardner [États-Unis] ; P. Gritzmann [Allemagne] ; D. Prangenberg [Allemagne]

Source :

Theoretical Computer Science [ 0304-3975 ] ; 2000.

RBID : ISTEX:C46DED77C24E5612284A1BB494E45C8BD493A9FA

Descripteurs français

Pascal (Inist)
- Algorithme, Complexité calcul, Consistance, Ordonnancement, Problème NP complet, Stabilité, Stisfiabilité, Table contingence, Temps polynomial, Théorème unicité, Tomographie, Treillis.

English descriptors

KwdEn :
- Algorithm, Computational complexity, Consistency, Contingency table, Lattice, NP complete problem, Polynomial time, Scheduling, Stability, Stisfiability, Tomography, Uniqueness theorem.

Abstract

The problem of recovering the structure of crystalline materials from their discrete X-rays is of fundamental interest in many practical applications. An important special case concerns determining the position of atoms of several different types in the integer lattice, given the number of each type lying on each line parallel to some lattice directions. We show that the corresponding consistency problem is NP-complete for any two (or more) different (fixed) directions when six (or more) types of atoms are involved.

Url:

https://api.istex.fr/document/C46DED77C24E5612284A1BB494E45C8BD493A9FA/fulltext/pdf

DOI: 10.1016/S0304-3975(97)00298-3

Affiliations:

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>On the computational complexity of determining polyatomic structures by X-rays</title>
<author><name sortKey="Gardner, R J" sort="Gardner, R J" uniqKey="Gardner R" first="R. J." last="Gardner">R. J. Gardner</name>
</author>
<author><name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
</author>
<author><name sortKey="Prangenberg, D" sort="Prangenberg, D" uniqKey="Prangenberg D" first="D." last="Prangenberg">D. Prangenberg</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:C46DED77C24E5612284A1BB494E45C8BD493A9FA</idno>
<date when="2000" year="2000">2000</date>
<idno type="doi">10.1016/S0304-3975(97)00298-3</idno>
<idno type="url">https://api.istex.fr/document/C46DED77C24E5612284A1BB494E45C8BD493A9FA/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001102</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001102</idno>
<idno type="wicri:Area/Istex/Curation">000F91</idno>
<idno type="wicri:Area/Istex/Checkpoint">000C61</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000C61</idno>
<idno type="wicri:doubleKey">0304-3975:2000:Gardner R:on:the:computational</idno>
<idno type="wicri:Area/Main/Merge">002237</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:00-0085696</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000F54</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000015</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000C73</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000C73</idno>
<idno type="wicri:doubleKey">0304-3975:2000:Gardner R:on:the:computational</idno>
<idno type="wicri:Area/Main/Merge">002319</idno>
<idno type="wicri:Area/Main/Curation">001F24</idno>
<idno type="wicri:Area/Main/Exploration">001F24</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a">On the computational complexity of determining polyatomic structures by X-rays</title>
<author><name sortKey="Gardner, R J" sort="Gardner, R J" uniqKey="Gardner R" first="R. J." last="Gardner">R. J. Gardner</name>
<affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country>
</affiliation>
<affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Western Washington University, Department of Mathematics, Bellingham, WA 98225-9063</wicri:regionArea>
<placeName><region type="state">Washington (État)</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
<affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Technische Universität München, Zentrum Mathematik, D-80290 München</wicri:regionArea>
<orgName type="university">Université technique de Munich</orgName>
<placeName><settlement type="city">Munich</settlement>
<region type="land" nuts="1">Bavière</region>
<region type="district" nuts="2">District de Haute-Bavière</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Prangenberg, D" sort="Prangenberg, D" uniqKey="Prangenberg D" first="D." last="Prangenberg">D. Prangenberg</name>
<affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Universität Trier, Fachbereich IV, Mathematik, Postfach 3825, D-54286 Trier</wicri:regionArea>
<wicri:noRegion>54286 Trier</wicri:noRegion>
<wicri:noRegion>D-54286 Trier</wicri:noRegion>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Theoretical Computer Science</title>
<title level="j" type="abbrev">TCS</title>
<idno type="ISSN">0304-3975</idno>
<imprint><publisher>ELSEVIER</publisher>
<date type="published" when="2000">2000</date>
<biblScope unit="volume">233</biblScope>
<biblScope unit="issue">1–2</biblScope>
<biblScope unit="page" from="91">91</biblScope>
<biblScope unit="page" to="106">106</biblScope>
</imprint>
<idno type="ISSN">0304-3975</idno>
</series>
<idno type="istex">C46DED77C24E5612284A1BB494E45C8BD493A9FA</idno>
<idno type="DOI">10.1016/S0304-3975(97)00298-3</idno>
<idno type="PII">S0304-3975(97)00298-3</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Computational complexity</term>
<term>Consistency</term>
<term>Contingency table</term>
<term>Lattice</term>
<term>NP complete problem</term>
<term>Polynomial time</term>
<term>Scheduling</term>
<term>Stability</term>
<term>Stisfiability</term>
<term>Tomography</term>
<term>Uniqueness theorem</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Algorithme</term>
<term>Complexité calcul</term>
<term>Consistance</term>
<term>Ordonnancement</term>
<term>Problème NP complet</term>
<term>Stabilité</term>
<term>Stisfiabilité</term>
<term>Table contingence</term>
<term>Temps polynomial</term>
<term>Théorème unicité</term>
<term>Tomographie</term>
<term>Treillis</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The problem of recovering the structure of crystalline materials from their discrete X-rays is of fundamental interest in many practical applications. An important special case concerns determining the position of atoms of several different types in the integer lattice, given the number of each type lying on each line parallel to some lattice directions. We show that the corresponding consistency problem is NP-complete for any two (or more) different (fixed) directions when six (or more) types of atoms are involved.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
<li>États-Unis</li>
</country>
<region><li>Bavière</li>
<li>District de Haute-Bavière</li>
<li>Washington (État)</li>
</region>
<settlement><li>Munich</li>
</settlement>
<orgName><li>Université technique de Munich</li>
</orgName>
</list>
<tree><country name="États-Unis"><noRegion><name sortKey="Gardner, R J" sort="Gardner, R J" uniqKey="Gardner R" first="R. J." last="Gardner">R. J. Gardner</name>
</noRegion>
<name sortKey="Gardner, R J" sort="Gardner, R J" uniqKey="Gardner R" first="R. J." last="Gardner">R. J. Gardner</name>
</country>
<country name="Allemagne"><region name="Bavière"><name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
</region>
<name sortKey="Prangenberg, D" sort="Prangenberg, D" uniqKey="Prangenberg D" first="D." last="Prangenberg">D. Prangenberg</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001F24 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001F24 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:C46DED77C24E5612284A1BB494E45C8BD493A9FA
   |texte=   On the computational complexity of determining polyatomic structures by X-rays
}}

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024

Serveur d'exploration sur l'Université de Trèves

On the computational complexity of determining polyatomic structures by X-rays

On the computational complexity of determining polyatomic structures by X-rays

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur l'Université de Trèves
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.