AbsEn.i
Exploration
Accueil
Racine
Exploration
Accueil
Racine

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

Index « AbsEn.i » - entrée « solvability »
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.
solutions < solvability < solvable  Facettes :

List of bibliographic references indexed by solvability

Number of relevant bibliographic references: 14.
Ident.Authors (with country if any)Title
001470 (2013) Takahito Aoto [Japon] ; Munehiro Iwami [Japon]Termination of Rule-Based Calculi for Uniform Semi-Unification
003169 (2010) Yannick Chevalier [France] ; Michael Rusinowitch [France]Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures
003D58 (2008-11-14) Stefan Canzar [France]Lagrangian Relaxation - Solving NP-hard Problems in Computational Biology via Combinatorial Optimization
006286 (2005) Yannick Chevalier [France] ; Michaël Rusinowitch [France]Combining Intruder Theories
006543 (2005) Yannick Chevalier ; Michaël Rusinowitch [France]Combining Intruder Theories
008F07 (2001) Guillaume Hanrot ; Francois MorainSolvability by radicals from an algorithmic point of view
009571 (2001) Guillaume Hanrot [France] ; François Morain [France]Solvability by radicals from an algorithmic point of view
009572 (2001) Guillaume Hanrot [France] ; François Morain [France]Solvability by Radicals from an Algorithmic Point of View
00A577 (1999) Miki Hermann ; Phokion G. KolaitisComputational Complexity of Simultaneous Elementary Matching Problems
00AA28 (1999) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Computational Complexity of Simultaneous Elementary Matching Problems
00B883 (1997) Miki Hermann ; Phokion G. KolaitisOn the complexity of unification and disunification in commutative idempotent semigroups
00BC30 (1997) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]On the complexity of unification and disunification in commutative idempotent semigroups
00C354 (1995) N. Hermann ; P. G. KolaitisComputational Complexity of Simultaneous Elementary Matching Problems
00C774 (1995) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Computational complexity of simultaneous elementary matching problems

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/AbsEn.i -k "solvability" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/AbsEn.i  \
                -Sk "solvability" \
         | 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=    AbsEn.i
   |clé=    solvability
}}
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