InforLorV4, PascalFrancis, Corpus, bibRecord, 000399

Towards an implicit characterization of NCk

Identifieur interne : 000399 ( PascalFrancis/Corpus ); précédent : 000398; suivant : 000400

Towards an implicit characterization of NCk

Auteurs : G. Bonfante ; R. Kahle ; J.-Y. Marion ; I. Oitavem

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2006.

RBID : Pascal:07-0471898

Descripteurs français

Pascal (Inist)
- Programmation logique, Pointeur.

English descriptors

KwdEn :
- Logical programming, Pointer.

Abstract

We define a hierarchy of term systems T^k by means of restrictions of the recursion schema. We essentially use a pointer technique together with tiering. We prove T^k C NC^k C T^k+1, for k > 2. Special attention is put on the description of T² and T³ and on the proof of T² ⊆ NC² C T³. Such a hierarchy yields a characterization of NC.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 4207`
A08	`01`	`1`	`ENG`	`@1 Towards an implicit characterization of NC^k`
A09	`01`	`1`	`ENG`	`@1 Computer science logic : 20th international workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006 : proceedings`
A11	`01`	`1`		`@1 BONFANTE (G.)`
A11	`02`	`1`		`@1 KAHLE (R.)`
A11	`03`	`1`		`@1 MARION (J.-Y.)`
A11	`04`	`1`		`@1 OITAVEM (I.)`
A12	`01`	`1`		`@1 ESIK (Zoltan) @9 ed.`
A14	`01`			`@1 Loria -INPL, 615, rue du Jardin Botanique, BP-101 @2 54602 Villers-lès-Nancy @3 FRA @Z 1 aut. @Z 3 aut.`
A14	`02`			`@1 Dept. Matemática, Universidade de Coimbra, Apartado 3008 @2 3001-454 Coimbra @3 PRT @Z 2 aut.`
A14	`03`			`@1 CENTRIA, UNL @2 2829-516 Caparica @3 PRT @Z 2 aut.`
A14	`04`			`@1 CMAF, Universidade de Lisboa, Av. Prof. Gama Pinto, 2 @2 1649-003 Lisboa @3 PRT @Z 4 aut.`
A14	`05`			`@1 DM, UNL @2 2829-516 Caparica @3 PRT @Z 4 aut.`
A18	`01`	`1`		`@1 European Association for Computer Science Logic. Conference @3 HUN`
A20				`@1 212-224`
A21				`@1 2006`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-45458-6`
A43	`01`			`@1 INIST @2 16343 @5 354000153609940140`
A44				`@0 0000 @1 © 2007 INIST-CNRS. All rights reserved.`
A45				`@0 1 p.`
A47	`01`	`1`		`@0 07-0471898`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
A66	`02`			`@0 USA`
C01	`01`		`ENG`	`@0 We define a hierarchy of term systems T^k by means of restrictions of the recursion schema. We essentially use a pointer technique together with tiering. We prove T^k C NC^k C T^k+1, for k > 2. Special attention is put on the description of T² and T³ and on the proof of T² ⊆ NC² C T³. Such a hierarchy yields a characterization of NC.`
C02	`01`	`X`		`@0 001D02A04`
C03	`01`	`X`	`FRE`	`@0 Programmation logique @5 01`
C03	`01`	`X`	`ENG`	`@0 Logical programming @5 01`
C03	`01`	`X`	`SPA`	`@0 Programación lógica @5 01`
C03	`02`	`X`	`FRE`	`@0 Pointeur @5 18`
C03	`02`	`X`	`ENG`	`@0 Pointer @5 18`
C03	`02`	`X`	`SPA`	`@0 Marcador @5 18`
N21				`@1 309`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

A30	`01`	`1`	`ENG`	`@1 International Workshop on Computer Science Logic @2 20 @3 Szeged HUN @4 2006`

Format Inist (serveur)

NO :	PASCAL 07-0471898 INIST
ET :	Towards an implicit characterization of NC^k
AU :	BONFANTE (G.); KAHLE (R.); MARION (J.-Y.); OITAVEM (I.); ESIK (Zoltan)
AF :	Loria -INPL, 615, rue du Jardin Botanique, BP-101/54602 Villers-lès-Nancy/France (1 aut., 3 aut.); Dept. Matemática, Universidade de Coimbra, Apartado 3008/3001-454 Coimbra/Portugal (2 aut.); CENTRIA, UNL/2829-516 Caparica/Portugal (2 aut.); CMAF, Universidade de Lisboa, Av. Prof. Gama Pinto, 2/1649-003 Lisboa/Portugal (4 aut.); DM, UNL/2829-516 Caparica/Portugal (4 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2006; Vol. 4207; Pp. 212-224; Bibl. 1 p.
LA :	Anglais
EA :	We define a hierarchy of term systems T^k by means of restrictions of the recursion schema. We essentially use a pointer technique together with tiering. We prove T^k C NC^k C T^k+1, for k > 2. Special attention is put on the description of T² and T³ and on the proof of T² ⊆ NC² C T³. Such a hierarchy yields a characterization of NC.
CC :	001D02A04
FD :	Programmation logique; Pointeur
ED :	Logical programming; Pointer
SD :	Programación lógica; Marcador
LO :	INIST-16343.354000153609940140
ID :	07-0471898

Links to Exploration step

Pascal:07-0471898

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Towards an implicit characterization of NC<sup>k</sup>
</title>
<author><name sortKey="Bonfante, G" sort="Bonfante, G" uniqKey="Bonfante G" first="G." last="Bonfante">G. Bonfante</name>
<affiliation><inist:fA14 i1="01"><s1>Loria -INPL, 615, rue du Jardin Botanique, BP-101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kahle, R" sort="Kahle, R" uniqKey="Kahle R" first="R." last="Kahle">R. Kahle</name>
<affiliation><inist:fA14 i1="02"><s1>Dept. Matemática, Universidade de Coimbra, Apartado 3008</s1>
<s2>3001-454 Coimbra</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="03"><s1>CENTRIA, UNL</s1>
<s2>2829-516 Caparica</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Marion, J Y" sort="Marion, J Y" uniqKey="Marion J" first="J.-Y." last="Marion">J.-Y. Marion</name>
<affiliation><inist:fA14 i1="01"><s1>Loria -INPL, 615, rue du Jardin Botanique, BP-101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Oitavem, I" sort="Oitavem, I" uniqKey="Oitavem I" first="I." last="Oitavem">I. Oitavem</name>
<affiliation><inist:fA14 i1="04"><s1>CMAF, Universidade de Lisboa, Av. Prof. Gama Pinto, 2</s1>
<s2>1649-003 Lisboa</s2>
<s3>PRT</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="05"><s1>DM, UNL</s1>
<s2>2829-516 Caparica</s2>
<s3>PRT</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">07-0471898</idno>
<date when="2006">2006</date>
<idno type="stanalyst">PASCAL 07-0471898 INIST</idno>
<idno type="RBID">Pascal:07-0471898</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000399</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Towards an implicit characterization of NC<sup>k</sup>
</title>
<author><name sortKey="Bonfante, G" sort="Bonfante, G" uniqKey="Bonfante G" first="G." last="Bonfante">G. Bonfante</name>
<affiliation><inist:fA14 i1="01"><s1>Loria -INPL, 615, rue du Jardin Botanique, BP-101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kahle, R" sort="Kahle, R" uniqKey="Kahle R" first="R." last="Kahle">R. Kahle</name>
<affiliation><inist:fA14 i1="02"><s1>Dept. Matemática, Universidade de Coimbra, Apartado 3008</s1>
<s2>3001-454 Coimbra</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="03"><s1>CENTRIA, UNL</s1>
<s2>2829-516 Caparica</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Marion, J Y" sort="Marion, J Y" uniqKey="Marion J" first="J.-Y." last="Marion">J.-Y. Marion</name>
<affiliation><inist:fA14 i1="01"><s1>Loria -INPL, 615, rue du Jardin Botanique, BP-101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Oitavem, I" sort="Oitavem, I" uniqKey="Oitavem I" first="I." last="Oitavem">I. Oitavem</name>
<affiliation><inist:fA14 i1="04"><s1>CMAF, Universidade de Lisboa, Av. Prof. Gama Pinto, 2</s1>
<s2>1649-003 Lisboa</s2>
<s3>PRT</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="05"><s1>DM, UNL</s1>
<s2>2829-516 Caparica</s2>
<s3>PRT</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2006">2006</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Logical programming</term>
<term>Pointer</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Programmation logique</term>
<term>Pointeur</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We define a hierarchy of term systems T<sup>k</sup>
 by means of restrictions of the recursion schema. We essentially use a pointer technique together with tiering. We prove T<sup>k</sup>
 C NC<sup>k</sup>
 C T<sup>k+1</sup>
, for k > 2. Special attention is put on the description of T<sup>2</sup>
 and T<sup>3</sup>
 and on the proof of T<sup>2</sup>
 ⊆ NC<sup>2</sup>
 C T<sup>3</sup>
. Such a hierarchy yields a characterization of NC.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>4207</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Towards an implicit characterization of NC<sup>k</sup>
</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Computer science logic : 20th international workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006 : proceedings</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>BONFANTE (G.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>KAHLE (R.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>MARION (J.-Y.)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>OITAVEM (I.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>ESIK (Zoltan)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Loria -INPL, 615, rue du Jardin Botanique, BP-101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Dept. Matemática, Universidade de Coimbra, Apartado 3008</s1>
<s2>3001-454 Coimbra</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>CENTRIA, UNL</s1>
<s2>2829-516 Caparica</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="04"><s1>CMAF, Universidade de Lisboa, Av. Prof. Gama Pinto, 2</s1>
<s2>1649-003 Lisboa</s2>
<s3>PRT</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA14 i1="05"><s1>DM, UNL</s1>
<s2>2829-516 Caparica</s2>
<s3>PRT</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA18 i1="01" i2="1"><s1>European Association for Computer Science Logic. Conference</s1>
<s3>HUN</s3>
</fA18>
<fA20><s1>212-224</s1>
</fA20>
<fA21><s1>2006</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-45458-6</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000153609940140</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2007 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>1 p.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>07-0471898</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We define a hierarchy of term systems T<sup>k</sup>
 by means of restrictions of the recursion schema. We essentially use a pointer technique together with tiering. We prove T<sup>k</sup>
 C NC<sup>k</sup>
 C T<sup>k+1</sup>
, for k > 2. Special attention is put on the description of T<sup>2</sup>
 and T<sup>3</sup>
 and on the proof of T<sup>2</sup>
 ⊆ NC<sup>2</sup>
 C T<sup>3</sup>
. Such a hierarchy yields a characterization of NC.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A04</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Programmation logique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Logical programming</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Programación lógica</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Pointeur</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Pointer</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Marcador</s0>
<s5>18</s5>
</fC03>
<fN21><s1>309</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International Workshop on Computer Science Logic</s1>
<s2>20</s2>
<s3>Szeged HUN</s3>
<s4>2006</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 07-0471898 INIST</NO>
<ET>Towards an implicit characterization of NC<sup>k</sup>
</ET>
<AU>BONFANTE (G.); KAHLE (R.); MARION (J.-Y.); OITAVEM (I.); ESIK (Zoltan)</AU>
<AF>Loria -INPL, 615, rue du Jardin Botanique, BP-101/54602 Villers-lès-Nancy/France (1 aut., 3 aut.); Dept. Matemática, Universidade de Coimbra, Apartado 3008/3001-454 Coimbra/Portugal (2 aut.); CENTRIA, UNL/2829-516 Caparica/Portugal (2 aut.); CMAF, Universidade de Lisboa, Av. Prof. Gama Pinto, 2/1649-003 Lisboa/Portugal (4 aut.); DM, UNL/2829-516 Caparica/Portugal (4 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2006; Vol. 4207; Pp. 212-224; Bibl. 1 p.</SO>
<LA>Anglais</LA>
<EA>We define a hierarchy of term systems T<sup>k</sup>
 by means of restrictions of the recursion schema. We essentially use a pointer technique together with tiering. We prove T<sup>k</sup>
 C NC<sup>k</sup>
 C T<sup>k+1</sup>
, for k > 2. Special attention is put on the description of T<sup>2</sup>
 and T<sup>3</sup>
 and on the proof of T<sup>2</sup>
 ⊆ NC<sup>2</sup>
 C T<sup>3</sup>
. Such a hierarchy yields a characterization of NC.</EA>
<CC>001D02A04</CC>
<FD>Programmation logique; Pointeur</FD>
<ED>Logical programming; Pointer</ED>
<SD>Programación lógica; Marcador</SD>
<LO>INIST-16343.354000153609940140</LO>
<ID>07-0471898</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 000399 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000399 | 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:07-0471898
   |texte=   Towards an implicit characterization of NCk
}}

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

	Serveur d'exploration sur la recherche en informatique en Lorraine
	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 la recherche en informatique en Lorraine

Towards an implicit characterization of NCk

Towards an implicit characterization of NCk

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

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