On the computational complexity of determining polyatomic structures by X-rays
Identifieur interne : 000F54 ( PascalFrancis/Corpus ); précédent : 000F53; suivant : 000F55On the computational complexity of determining polyatomic structures by X-rays
Auteurs : R. J. Gardner ; P. Gritzmann ; D. PrangenbergSource :
- Theoretical computer science [ 0304-3975 ] ; 2000.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
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.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
pA |
|
---|
Format Inist (serveur)
NO : | PASCAL 00-0085696 INIST |
---|---|
ET : | On the computational complexity of determining polyatomic structures by X-rays |
AU : | GARDNER (R. J.); GRITZMANN (P.); PRANGENBERG (D.) |
AF : | Western Washington University, Department of Mathematics/Bellingham, WA 98225-9063/Etats-Unis (1 aut.); Technische Universität München, Zentrum Mathematik/80290 München/Allemagne (2 aut.); Universität Trier, Fachbereich IV, Mathematik, Postfach 3825/54286 Trier/Allemagne (3 aut.) |
DT : | Publication en série; Niveau analytique |
SO : | Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 2000; Vol. 233; No. 1-2; Pp. 91-106; Bibl. 15 ref. |
LA : | Anglais |
EA : | 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. |
CC : | 001A02B01; 001D02A05; 002B24A10; 001D01A03 |
FD : | Tomographie; Complexité calcul; Algorithme; Temps polynomial; Problème NP complet; Treillis; Ordonnancement; Table contingence; Consistance; Stabilité; Théorème unicité; Stisfiabilité |
ED : | Tomography; Computational complexity; Algorithm; Polynomial time; NP complete problem; Lattice; Scheduling; Contingency table; Consistency; Stability; Uniqueness theorem; Stisfiability |
SD : | Tomografía; Complejidad computación; Algoritmo; Tiempo polinomial; Problema NP completo; Enrejado; Ordonamiento; Tabla contingencia; Consistencia; Estabilidad; Teorema unicidad |
LO : | INIST-17243.354000081470850060 |
ID : | 00-0085696 |
Links to Exploration step
Pascal:00-0085696Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" 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><inist:fA14 i1="01"><s1>Western Washington University, Department of Mathematics</s1>
<s2>Bellingham, WA 98225-9063</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
<affiliation><inist:fA14 i1="02"><s1>Technische Universität München, Zentrum Mathematik</s1>
<s2>80290 München</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Prangenberg, D" sort="Prangenberg, D" uniqKey="Prangenberg D" first="D." last="Prangenberg">D. Prangenberg</name>
<affiliation><inist:fA14 i1="03"><s1>Universität Trier, Fachbereich IV, Mathematik, Postfach 3825</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">00-0085696</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 00-0085696 INIST</idno>
<idno type="RBID">Pascal:00-0085696</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000F54</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" 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><inist:fA14 i1="01"><s1>Western Washington University, Department of Mathematics</s1>
<s2>Bellingham, WA 98225-9063</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
<affiliation><inist:fA14 i1="02"><s1>Technische Universität München, Zentrum Mathematik</s1>
<s2>80290 München</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Prangenberg, D" sort="Prangenberg, D" uniqKey="Prangenberg D" first="D." last="Prangenberg">D. Prangenberg</name>
<affiliation><inist:fA14 i1="03"><s1>Universität Trier, Fachbereich IV, Mathematik, Postfach 3825</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date when="2000">2000</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<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>Tomographie</term>
<term>Complexité calcul</term>
<term>Algorithme</term>
<term>Temps polynomial</term>
<term>Problème NP complet</term>
<term>Treillis</term>
<term>Ordonnancement</term>
<term>Table contingence</term>
<term>Consistance</term>
<term>Stabilité</term>
<term>Théorème unicité</term>
<term>Stisfiabilité</term>
</keywords>
</textClass>
</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>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0304-3975</s0>
</fA01>
<fA02 i1="01"><s0>TCSCDI</s0>
</fA02>
<fA03 i2="1"><s0>Theor. comput. sci.</s0>
</fA03>
<fA05><s2>233</s2>
</fA05>
<fA06><s2>1-2</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>On the computational complexity of determining polyatomic structures by X-rays</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>GARDNER (R. J.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>GRITZMANN (P.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>PRANGENBERG (D.)</s1>
</fA11>
<fA14 i1="01"><s1>Western Washington University, Department of Mathematics</s1>
<s2>Bellingham, WA 98225-9063</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Technische Universität München, Zentrum Mathematik</s1>
<s2>80290 München</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Universität Trier, Fachbereich IV, Mathematik, Postfach 3825</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>91-106</s1>
</fA20>
<fA21><s1>2000</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>17243</s2>
<s5>354000081470850060</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2000 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>15 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>00-0085696</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Theoretical computer science</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001A02B01</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A05</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>002B24A10</s0>
</fC02>
<fC02 i1="04" i2="X"><s0>001D01A03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Tomographie</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Tomography</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Tomografía</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Complexité calcul</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Computational complexity</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Complejidad computación</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Algorithme</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Algorithm</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Algoritmo</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Temps polynomial</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Polynomial time</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Tiempo polinomial</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Problème NP complet</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>NP complete problem</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Problema NP completo</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Treillis</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Lattice</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Enrejado</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Ordonnancement</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Scheduling</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Ordonamiento</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Table contingence</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Contingency table</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Tabla contingencia</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Consistance</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Consistency</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Consistencia</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Stabilité</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Stability</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Estabilidad</s0>
<s5>10</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Théorème unicité</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Uniqueness theorem</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Teorema unicidad</s0>
<s5>11</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Stisfiabilité</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Stisfiability</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>059</s1>
</fN21>
</pA>
</standard>
<server><NO>PASCAL 00-0085696 INIST</NO>
<ET>On the computational complexity of determining polyatomic structures by X-rays</ET>
<AU>GARDNER (R. J.); GRITZMANN (P.); PRANGENBERG (D.)</AU>
<AF>Western Washington University, Department of Mathematics/Bellingham, WA 98225-9063/Etats-Unis (1 aut.); Technische Universität München, Zentrum Mathematik/80290 München/Allemagne (2 aut.); Universität Trier, Fachbereich IV, Mathematik, Postfach 3825/54286 Trier/Allemagne (3 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 2000; Vol. 233; No. 1-2; Pp. 91-106; Bibl. 15 ref.</SO>
<LA>Anglais</LA>
<EA>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.</EA>
<CC>001A02B01; 001D02A05; 002B24A10; 001D01A03</CC>
<FD>Tomographie; Complexité calcul; Algorithme; Temps polynomial; Problème NP complet; Treillis; Ordonnancement; Table contingence; Consistance; Stabilité; Théorème unicité; Stisfiabilité</FD>
<ED>Tomography; Computational complexity; Algorithm; Polynomial time; NP complete problem; Lattice; Scheduling; Contingency table; Consistency; Stability; Uniqueness theorem; Stisfiability</ED>
<SD>Tomografía; Complejidad computación; Algoritmo; Tiempo polinomial; Problema NP completo; Enrejado; Ordonamiento; Tabla contingencia; Consistencia; Estabilidad; Teorema unicidad</SD>
<LO>INIST-17243.354000081470850060</LO>
<ID>00-0085696</ID>
</server>
</inist>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000F54 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000F54 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Rhénanie |area= UnivTrevesV1 |flux= PascalFrancis |étape= Corpus |type= RBID |clé= Pascal:00-0085696 |texte= On the computational complexity of determining polyatomic structures by X-rays }}
This area was generated with Dilib version V0.6.31. |