Teeft.i
Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Teeft.i » - entrée « Polynomial time »
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.
Polynomial systems < Polynomial time < Polynomial time equivalent  Facettes :

List of bibliographic references indexed by Polynomial time

Number of relevant bibliographic references: 16.
Ident.Authors (with country if any)Title
001E50 (2012) Gaetan BissonComputing endomorphism rings of elliptic curves under the GRH
001E56 (2012) J. Remacle [Belgique] ; J. Lambrechts [Belgique] ; B. Seny [Belgique] ; E. Marchandise [Belgique] ; A. Johnen [Belgique] ; C. Euzainet [Belgique]Blossom‐Quad: A non‐uniform quadrilateral mesh generator using a minimum‐cost perfect‐matching algorithm
006250 (2005) Olivier Bournez ; Felipe Cucker ; Paulin Jacobe De Naurois ; Jean-Yves MarionImplicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
009254 (2001) Georg Gottlob [Autriche] ; Reinhard Pichler [Autriche]Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
009E04 (2000) Miki Hermann [France] ; Phokion G. KolaitisUnification Algorithms Cannot Be Combined in Polynomial Time
009E33 (2000) Hubert Comon [France]Sequentiality, Monadic Second-Order Logic and Tree Automata
009E82 (2000) Index
00A844 (1999) Jean-Yves Marion [France]From multiple sequent for additive linear logic to decision procedures for free lattices
00A851 (1999) Cumulative index volumes 1–200
00B378 (1998) R. De Queiroz ; M. FingerConferences. Wollic'98, workshop on logic, language, information and computation
00BC52 (1997) Ruy J. G. B. De QueirozFourth Workshop on Logic, Language, Information and Computation (WoLLIC'97)
00C079 (1996) Nadia Creignou [France] ; Miki Hermann [France]Complexity of Generalized Satisfiability Counting Problems
00C641 (1995) Cumulative index volumes 101–150
00C642 (1995) Cumulative index volumes 101–150
00E359 (1988) Paliath Narendran [États-Unis] ; Friedrich Otto [États-Unis]Elements of finite order for finite weight-reducing and confluent thue systems
00EF50 (1977) Zvi Galil [États-Unis]Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Teeft.i -k "Polynomial time" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Teeft.i  \
                -Sk "Polynomial time" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Teeft.i
   |clé=    Polynomial time
}}
Wicri

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