provably < prove < proved

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
000435 (1993)	M. Roters [Allemagne]	On a ranking problem for symmetric and unimodal location parameter families
000721 (1998)	Nguyen V. Thoai [Allemagne]	On Tikhonov's Reciprocity Principle and Optimality Conditions in d.c. Optimization
000B34 (1996)	Carsten Damm [Allemagne] ; Markus Holzer [Allemagne]	Inductive Counting for Width-Restricted Branching Programs
000B50 (1995)	S. Ito [Japon] ; C. T. Kelley ; E. W. Sachs [Allemagne]	Inexact primal-dual interior point iteration for linear programs in function spaces
000B57 (1995)	Christoph Meinel ; Stephan Waack	Lower bounds for the modular communication complexity of various graph accessibility problems
000C69 (2000)	Vikraman Arvind [Inde] ; Johannes Köbler [Allemagne] ; Martin Mundhenk [Allemagne] ; Jacobo Torán [Allemagne]	Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
000C75 (1986)	Wolfgang Luh [Allemagne]	Approximation by antiderivatives
000D38 (1997)	Juan Carlos D Az [Espagne]	On 2-Homogeneous Polynomials on Some Non-stable Banach and Fréchet Spaces
000D49 (1996)	C. Meinel [Allemagne] ; S. Waack [Allemagne]	Lower bounds for the majority communication complexity of various graph accessibility problems
000D73 (1993)	D. Poth [Allemagne] ; J. F. W. Negendank [Allemagne]	Paleoclimate reconstruction at the Pleistocene/Holocene transition—A varve dated microstratigraphic record from Lake Meerfelder Maar (Westeifel, Germany)
000E36 (1997)	Klaus Jansen [Allemagne]	Approximation results for the optimum cost chromatic partition problem
000E52 (2006)	Henning Fernau [Allemagne]	edge dominating set : Efficient Enumeration-Based Exact Algorithms
000E60 (1997)	Martin Mundhenk [Allemagne] ; Judy Goldsmith [États-Unis] ; Eric Allender [États-Unis]	The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes
000E61 (1989)	C. T. Kelley [États-Unis] ; E. W. Sachs [Allemagne]	A pointwise quasi-Newton method for unconstrained optimal control problems
000E75 (1997)	Christoph Meinel [Allemagne] ; Thorsten Theobald [Allemagne]	On the influence of the state encoding on OBDD-representations of finite state machines
000F56 (1993)	Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne]	On the complexity of scheduling incompatible jobs with unit-times
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
000F98 (2012)	A. A. Albanese [Italie] ; D. Jornet [Espagne] ; A. Oliaro [Italie]	Wave front sets for ultradistribution solutions of linear partial differential operators with coefficients in non‐quasianalytic classes
001013 (1981)	Karin Faulstich ; Wolfgang Luh ; Ludwig Tomm	Universelle Approximation durch Riesz-Transformierte der geometrischen Reihe
001025 (2001)	Valérie Gouranton [France] ; Pierre Réty [France] ; Helmut Seidl [Allemagne]	Synchronized Tree Languages Revisited and New 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 "prove" 

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

---

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