Implicit computational complexity
Identifieur interne :
000667 ( PascalFrancis/Corpus );
précédent :
000666;
suivant :
000668
Implicit computational complexity
Auteurs : Source :
-
Theoretical computer science [ 0304-3975 ] ; 2004.
RBID : Pascal:04-0318305
Descripteurs français
English descriptors
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
pA |
A01 | 01 | 1 | | @0 0304-3975 |
---|
A02 | 01 | | | @0 TCSCDI |
---|
A03 | | 1 | | @0 Theor. comput. sci. |
---|
A05 | | | | @2 318 |
---|
A06 | | | | @2 1-2 |
---|
A09 | 01 | 1 | ENG | @1 Implicit computational complexity |
---|
A12 | 01 | 1 | | @1 MARION (Jean-Yves) @9 ed. |
---|
A15 | 01 | | | @1 LORIA-INPL, Ecole Nationale Superieure des Mines de Nancy, BP 239 @2 Vandoeuvre-les-Nancy 54506 @3 FRA @Z 1 aut. |
---|
A21 | | | | @1 2004 |
---|
A23 | 01 | | | @0 ENG |
---|
A29 | | | | @1 244 p. |
---|
A43 | 01 | | | @1 INIST @2 17243 @5 354000110408220000 |
---|
A44 | | | | @0 0000 @1 © 2004 INIST-CNRS. All rights reserved. |
---|
A45 | | | | @0 dissem. |
---|
A47 | 01 | 1 | | @0 04-0318305 |
---|
A60 | | | | @1 P @2 C |
---|
A61 | | | | @0 M |
---|
A64 | 01 | 1 | | @0 Theoretical computer science |
---|
A66 | 01 | | | @0 NLD |
---|
C02 | 01 | X | | @0 001D02A08 |
---|
C03 | 01 | X | FRE | @0 Informatique théorique @5 17 |
---|
C03 | 01 | X | ENG | @0 Computer theory @5 17 |
---|
C03 | 01 | X | SPA | @0 Informática teórica @5 17 |
---|
N21 | | | | @1 187 |
---|
N44 | 01 | | | @1 OTO |
---|
N82 | | | | @1 OTO |
---|
|
pR |
A30 | 01 | 1 | ENG | @1 ICC Workshop @3 Santa Barbara, CA USA @4 2000 |
---|
|
Format Inist (serveur)
NO : | PASCAL 04-0318305 INIST |
ET : | Implicit computational complexity |
AU : | MARION (Jean-Yves) |
AF : | LORIA-INPL, Ecole Nationale Superieure des Mines de Nancy, BP 239/Vandoeuvre-les-Nancy 54506/France (1 aut.) |
DT : | Publication en série; Congrès; Niveau monographique |
SO : | Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 2004; Vol. 318; No. 1-2; ; Pp. 244 p.; Bibl. dissem. |
LA : | Anglais |
CC : | 001D02A08 |
FD : | Informatique théorique |
ED : | Computer theory |
SD : | Informática teórica |
LO : | INIST-17243.354000110408220000 |
ID : | 04-0318305 |
Links to Exploration step
Pascal:04-0318305
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="m">Implicit computational complexity</title>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INPL, Ecole Nationale Superieure des Mines de Nancy, BP 239</s1>
<s2>Vandoeuvre-les-Nancy 54506</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0318305</idno>
<date when="2004">2004</date>
<idno type="stanalyst">PASCAL 04-0318305 INIST</idno>
<idno type="RBID">Pascal:04-0318305</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000667</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic></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="2004">2004</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>Computer theory</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
</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>318</s2>
</fA05>
<fA06><s2>1-2</s2>
</fA06>
<fA09 i1="01" i2="1" l="ENG"><s1>Implicit computational complexity</s1>
</fA09>
<fA12 i1="01" i2="1"><s1>MARION (Jean-Yves)</s1>
<s9>ed.</s9>
</fA12>
<fA15 i1="01"><s1>LORIA-INPL, Ecole Nationale Superieure des Mines de Nancy, BP 239</s1>
<s2>Vandoeuvre-les-Nancy 54506</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA21><s1>2004</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA29><s1>244 p.</s1>
</fA29>
<fA43 i1="01"><s1>INIST</s1>
<s2>17243</s2>
<s5>354000110408220000</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>dissem.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>04-0318305</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA64 i1="01" i2="1"><s0>Theoretical computer science</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC02 i1="01" i2="X"><s0>001D02A08</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>17</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>17</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>17</s5>
</fC03>
<fN21><s1>187</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>ICC Workshop</s1>
<s3>Santa Barbara, CA USA</s3>
<s4>2000</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 04-0318305 INIST</NO>
<ET>Implicit computational complexity</ET>
<AU>MARION (Jean-Yves)</AU>
<AF>LORIA-INPL, Ecole Nationale Superieure des Mines de Nancy, BP 239/Vandoeuvre-les-Nancy 54506/France (1 aut.)</AF>
<DT>Publication en série; Congrès; Niveau monographique</DT>
<SO>Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 2004; Vol. 318; No. 1-2; ; Pp. 244 p.; Bibl. dissem.</SO>
<LA>Anglais</LA>
<CC>001D02A08</CC>
<FD>Informatique théorique</FD>
<ED>Computer theory</ED>
<SD>Informática teórica</SD>
<LO>INIST-17243.354000110408220000</LO>
<ID>04-0318305</ID>
</server>
</inist>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000667 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000667 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:04-0318305
|texte= Implicit computational complexity
}}
| This area was generated with Dilib version V0.6.33. Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022 | |