Serveur d'exploration sur la recherche en informatique en Lorraine - Analysis (USA)

Index « Auteurs » - entrée « Miki Hermann »
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.
Mikel Aickin < Miki Hermann < Miklo S Cserzo  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 11.
Ident.Authors (with country if any)Title
000536 (2004) Ángel J. Gil [Espagne, États-Unis] ; Miki Hermann [France] ; Gernot Salzer [Autriche] ; Bruno Zanuttini [France]Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains
000707 (2000) Arnaud Durand [France] ; Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Subtractive Reductions and Complete Problems for Counting Complexity Classes
000740 (1999-09) Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis]On the complexity of counting the Hilbert basis of a linear Diophantine system
000755 (1999) Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis]On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System
000768 (1999) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Computational Complexity of Simultaneous Elementary Matching Problems
000814 (1998) Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis]On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System
000830 (1997) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]On the complexity of unification and disunification in commutative idempotent semigroups
000853 (1996) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Unification algorithms cannot be combined in polynomial time
000889 (1995) Miki Hermann [États-Unis] ; Phokion G. Kolaitis [États-Unis]The Complexity of Counting Problems in Equational Matching
000901 (1995) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Computational complexity of simultaneous elementary matching problems
000911 (1994) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]The complexity of counting problems in equational matching

List of associated KwdEn.i

Nombre de
documents
Descripteur
3Computational complexity
2Diophantine equation
2Logical programming
2Unification
1#P-completeness
1Algorithm complexity
1Artificial intelligence
1Automatic deduction
1Boolean expression
1Cardinal number
1Complexity class
1Computer theory
1Counting
1Diophantine equations
1Equation system solving
1Equational theory
1Group theory
1Hilbert problem
1NP hard problem
1NP-completeness
1Polynomial time
1Reduction
1Subtraction
1associative-commutative matching
1automated deduction
1computational complexity
1equational matching

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/USA/Analysis
HfdIndexSelect -h $EXPLOR_AREA/Data/USA/Analysis/Author.i -k "Miki Hermann" 
HfdIndexSelect -h $EXPLOR_AREA/Data/USA/Analysis/Author.i  \
                -Sk "Miki Hermann" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/USA/Analysis/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    USA
   |étape=   Analysis
   |type=    indexItem
   |index=    Author.i
   |clé=    Miki Hermann
}}

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