UnivTrevesV1, PascalFrancis, Curation, bibRecord, 000015

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

Identifieur interne : 000015 ( PascalFrancis/Curation ); précédent : 000014; suivant : 000016

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 : Pascal:00-0085696

Descripteurs français

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

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.

A01	`01`	`1`		`@0 0304-3975`
A02	`01`			`@0 TCSCDI`
A03		`1`		`@0 Theor. comput. sci.`
A05				`@2 233`
A06				`@2 1-2`
A08	`01`	`1`	`ENG`	`@1 On the computational complexity of determining polyatomic structures by X-rays`
A11	`01`	`1`		`@1 GARDNER (R. J.)`
A11	`02`	`1`		`@1 GRITZMANN (P.)`
A11	`03`	`1`		`@1 PRANGENBERG (D.)`
A14	`01`			`@1 Western Washington University, Department of Mathematics @2 Bellingham, WA 98225-9063 @3 USA @Z 1 aut.`
A14	`02`			`@1 Technische Universität München, Zentrum Mathematik @2 80290 München @3 DEU @Z 2 aut.`
A14	`03`			`@1 Universität Trier, Fachbereich IV, Mathematik, Postfach 3825 @2 54286 Trier @3 DEU @Z 3 aut.`
A20				`@1 91-106`
A21				`@1 2000`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 17243 @5 354000081470850060`
A44				`@0 0000 @1 © 2000 INIST-CNRS. All rights reserved.`
A45				`@0 15 ref.`
A47	`01`	`1`		`@0 00-0085696`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Theoretical computer science`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	@0 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.
C02	`01`	`X`		`@0 001A02B01`
C02	`02`	`X`		`@0 001D02A05`
C02	`03`	`X`		`@0 002B24A10`
C02	`04`	`X`		`@0 001D01A03`
C03	`01`	`X`	`FRE`	`@0 Tomographie @5 01`
C03	`01`	`X`	`ENG`	`@0 Tomography @5 01`
C03	`01`	`X`	`SPA`	`@0 Tomografía @5 01`
C03	`02`	`X`	`FRE`	`@0 Complexité calcul @5 02`
C03	`02`	`X`	`ENG`	`@0 Computational complexity @5 02`
C03	`02`	`X`	`SPA`	`@0 Complejidad computación @5 02`
C03	`03`	`X`	`FRE`	`@0 Algorithme @5 03`
C03	`03`	`X`	`ENG`	`@0 Algorithm @5 03`
C03	`03`	`X`	`SPA`	`@0 Algoritmo @5 03`
C03	`04`	`X`	`FRE`	`@0 Temps polynomial @5 04`
C03	`04`	`X`	`ENG`	`@0 Polynomial time @5 04`
C03	`04`	`X`	`SPA`	`@0 Tiempo polinomial @5 04`
C03	`05`	`X`	`FRE`	`@0 Problème NP complet @5 05`
C03	`05`	`X`	`ENG`	`@0 NP complete problem @5 05`
C03	`05`	`X`	`SPA`	`@0 Problema NP completo @5 05`
C03	`06`	`X`	`FRE`	`@0 Treillis @5 06`
C03	`06`	`X`	`ENG`	`@0 Lattice @5 06`
C03	`06`	`X`	`SPA`	`@0 Enrejado @5 06`
C03	`07`	`X`	`FRE`	`@0 Ordonnancement @5 07`
C03	`07`	`X`	`ENG`	`@0 Scheduling @5 07`
C03	`07`	`X`	`SPA`	`@0 Ordonamiento @5 07`
C03	`08`	`X`	`FRE`	`@0 Table contingence @5 08`
C03	`08`	`X`	`ENG`	`@0 Contingency table @5 08`
C03	`08`	`X`	`SPA`	`@0 Tabla contingencia @5 08`
C03	`09`	`X`	`FRE`	`@0 Consistance @5 09`
C03	`09`	`X`	`ENG`	`@0 Consistency @5 09`
C03	`09`	`X`	`SPA`	`@0 Consistencia @5 09`
C03	`10`	`X`	`FRE`	`@0 Stabilité @5 10`
C03	`10`	`X`	`ENG`	`@0 Stability @5 10`
C03	`10`	`X`	`SPA`	`@0 Estabilidad @5 10`
C03	`11`	`X`	`FRE`	`@0 Théorème unicité @5 11`
C03	`11`	`X`	`ENG`	`@0 Uniqueness theorem @5 11`
C03	`11`	`X`	`SPA`	`@0 Teorema unicidad @5 11`
C03	`12`	`X`	`FRE`	`@0 Stisfiabilité @4 CD @5 96`
C03	`12`	`X`	`ENG`	`@0 Stisfiability @4 CD @5 96`
N21				`@1 059`

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

to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000F54

Links to Exploration step

Pascal:00-0085696

Le 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 wicri:level="1"><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>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
<affiliation wicri:level="1"><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>
<country>Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Prangenberg, D" sort="Prangenberg, D" uniqKey="Prangenberg D" first="D." last="Prangenberg">D. Prangenberg</name>
<affiliation wicri:level="1"><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>
<country>Allemagne</country>
</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>
<idno type="wicri:Area/PascalFrancis/Curation">000015</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 wicri:level="1"><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>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
<affiliation wicri:level="1"><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>
<country>Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Prangenberg, D" sort="Prangenberg, D" uniqKey="Prangenberg D" first="D." last="Prangenberg">D. Prangenberg</name>
<affiliation wicri:level="1"><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>
<country>Allemagne</country>
</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>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Curation

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

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000015 | 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=   Curation
   |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.
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
	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.

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...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

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