Serveur d'exploration sur l'Université de Trèves - Curation (Istex)

Index « AbsEn.i » - entrée « polynomial »
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.
polynia < polynomial < polynomially  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 44.
[0-20] [0 - 20][0 - 44][20-40]
Ident.Authors (with country if any)Title
000776 (1998) Wolfgang Gehlen [Allemagne]On the Distribution of Alternation Points in Uniform Polynomial Approximation of Entire Functions
000925 (1999) Anna Bernasconi [Allemagne] ; Carsten Damm [Allemagne] ; Igor E. Shparlinski [Australie]On the Average Sensitivity of Testing Square-Free Numbers
000A03 (1993) Christoph Meinel [Allemagne] ; Stephan Waack [Allemagne]Separating complexity classes related to bounded alternating Ω-branching programs
000A33 (1997) Wolfgang Gehlen [Allemagne]On the Sequence of Errors in Best Polynomial Approximation
000B39 (2010) Anna Kasprzik [Allemagne]Generalizing over Several Learning Settings
000C82 (1994) L. Frerick [Allemagne] ; J. Müller [Allemagne]Polynomial approximation and maximal convergence on Faber sets
000C98 (1995) Thorsten Theobald [Allemagne]How to Break Shamir’s Asymmetric Basis
000D48 (1974) J. Kupsch ; I. O. StamatescuImpact-parameter amplitudes
000D63 (1999) Wolfgang Gehlen [Allemagne]On a Conjecture Concerning Strong Unicity Constants
000D68 (2000) Wolfgang Gehlen [Allemagne]Unboundedness of the Lipschitz Constants of Best Polynomial Approximation
000E36 (1997) Klaus Jansen [Allemagne]Approximation results for the optimum cost chromatic partition problem
000F73 (2010) Ljiljana Brankovic [Australie] ; Henning Fernau [Allemagne]Combining Two Worlds: Parameterised Approximation for Vertex Cover
000F74 (1993) Klaus Jansen [Allemagne] ; Petra Scheffler [Allemagne] ; Gerhard J. Woeginger [Autriche]Maximum covering with D cliques
000F89 (1992) U. Betke [Allemagne] ; P. Gritzmann [Allemagne]Projection algorithms for linear programming
000F93 (1995) M. Mundhenk [Allemagne]On monotonous oracle machines
001004 (1996) Jordan Gergov [Allemagne] ; Christoph Meinel [Allemagne]Mod-2-OBDDs—A data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams
001009 (1993) Klaus Jansen [Allemagne]On scheduling problems restricted to interval orders
001060 (1993) Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne] ; Gerhard J. Woeginger [Autriche]Scheduling with incompatible jobs
001064 (1993) Klaus Jansen [Allemagne]Scheduling with constrained processor allocation for interval orders
001094 (2001) Alberto Caprara [Italie] ; Alessandro Panconesi [Italie] ; Romeo Rizzi [Italie]Packing Cycles and Cuts in Undirected Graphs
001105 (1993) Klaus Jansen ; Petra SchefflerGeneralized coloring for tree-like graphs

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation
HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i -k "polynomial" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i  \
                -Sk "polynomial" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Istex
   |étape=   Curation
   |type=    indexItem
   |index=    AbsEn.i
   |clé=    polynomial
}}

Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024