bounding < bounds < bourgeois

Facettes :

List of bibliographic references

Number of relevant bibliographic references: 34.
[0-20] [0 - 20][0 - 34][20-33][20-40]

Ident.	Authors (with country if any)	Title
000842 (1975)	W. Langrein [Allemagne]	On holomorphic extrapolations of the scattering amplitude into the complex plane
000889 (1995)	Christoph Meinel ; Stephan Waack	Lower bounds for the majority communication complexity of various graph accessibility problems
000925 (1999)	Anna Bernasconi [Allemagne] ; Carsten Damm [Allemagne] ; Igor E. Shparlinski [Australie]	On the Average Sensitivity of Testing Square-Free Numbers
000960 (1987)	Jörg Hettich [Allemagne] ; E. Haaren [Allemagne] ; M. Ries [Allemagne] ; G. Still [Allemagne]	Accurate Numerical Approximations of Eigenfrequencies and Eigenfunctions of Elliptic Membranes
000A03 (1993)	Christoph Meinel [Allemagne] ; Stephan Waack [Allemagne]	Separating complexity classes related to bounded alternating Ω-branching programs
000B57 (1995)	Christoph Meinel ; Stephan Waack	Lower bounds for the modular communication complexity of various graph accessibility problems
000D48 (1974)	J. Kupsch ; I. O. Stamatescu	Impact-parameter amplitudes
000D49 (1996)	C. Meinel [Allemagne] ; S. Waack [Allemagne]	Lower bounds for the majority communication complexity of various graph accessibility problems
000E75 (1997)	Christoph Meinel [Allemagne] ; Thorsten Theobald [Allemagne]	On the influence of the state encoding on OBDD-representations of finite state machines
000F60 (1994)	Carsten Damm [Allemagne] ; Markus Holzer [Allemagne]	Inductive counting below logspace
000F69 (1995)	J. H Stad [Suède] ; S. Jukna [Lituanie, Allemagne] ; P. Pudlák [République tchèque, Burundi]	Top-down lower bounds for depth-three circuits
000F97 (1996)	M. Gugat [Allemagne]	An algorithm for chebyshev approximation by rationals with constrained denominators
001001 (2002)	Flemming Nielson [Danemark] ; Hanne Riis Nielson [Danemark] ; Helmut Seidl [Allemagne]	Automatic Complexity Analysis
001045 (1988)	Georg Still [Allemagne]	Computable bounds for eigenvalues and eigenfunctions of elliptic differential operators
001065 (1974)	W. Langbein	Reduction of ambiguities of the scattering amplitude by linear constraints
001142 (1996)	Michael Nast [Allemagne]	Subdivision of simplices relative to a cutting plane and finite concave minimization
001147 (1995)	C. Meinel [Allemagne] ; S. Waack [Allemagne]	Separating complexity classes related to bounded alternating ω-branching programs
001201 (1993)	Klaus Jansen [Allemagne]	Bounds for the general capacitated routing problem
001229 (1996)	V. Arvind [Inde] ; J. Köbler [Allemagne] ; M. Mundhenk [Allemagne]	Upper bounds for the complexity of sparse and tally descriptions
001230 (2003)	G. Still [Pays-Bas]	Approximation theory methods for solving elliptic eigenvalue problems
001278 (1995)	R. Horst [Allemagne] ; M. Nast [Allemagne] ; N. V. Thoai [Viêt Nam]	New LP bound in multivariate Lipschitz optimization: Theory and applications

---

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 "bounds" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i  \
                -Sk "bounds" \
         | 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é=    bounds
}}

---

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