exponent < exponential < exponentialbl

Facettes :

List of bibliographic references

Number of relevant bibliographic references: 22.
[0-20] [0 - 20][0 - 22][20-21][20-40]

Ident.	Authors (with country if any)	Title
000612 (2007)	Alexander Ivanyukovich [Italie] ; Maurizio Marchese [Italie] ; Patrick Reuther [Allemagne]	Assessing Quality Dynamics in Unsupervised Metadata Extraction for Digital Libraries
000626 (1982)	W. Eberl Jr. ; W. Sendler	Optimal tests in 1-parameter exponential families
000699 (1992)	M. Roters	Locally most powerful sequential tests for processes of the exponential class with stationary and independent increments
000A03 (1993)	Christoph Meinel [Allemagne] ; Stephan Waack [Allemagne]	Separating complexity classes related to bounded alternating Ω-branching programs
000E44 (1983)	K. Wagenerl [Allemagne] ; A. De Luca Rebello [Brésil] ; E. Hollstein [Allemagne]	Increasing productivity in recent european oak trees?
000E75 (1997)	Christoph Meinel [Allemagne] ; Thorsten Theobald [Allemagne]	On the influence of the state encoding on OBDD-representations of finite state 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
001147 (1995)	C. Meinel [Allemagne] ; S. Waack [Allemagne]	Separating complexity classes related to bounded alternating ω-branching programs
001283 (1996)	Christoph Meinel ; Stephan Waack	The “log rank” conjecture for modular communication complexity
001295 (1993)	Jordan Gergov ; Christoph Meinel	Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs
001342 (2002)	Flemming Nielson [Danemark] ; Hanne Riis Nielson [Danemark] ; Helmut Seidl [Allemagne]	Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
001351 (1997)	S. Jukna [Allemagne] ; A. Razborov [Russie, Cuba] ; P. Savick [République tchèque, Swaziland] ; I. Wegener [Allemagne]	On P versus NP∩co-NP for decision trees and read-once branching programs
001432 (1998)	S. Jukna [Allemagne] ; A. Razborov [Lituanie]	Neither reading few bits twice nor reading illegally helps much
001605 (2010)	Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne]	A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
001732 (2010)	Daniel Raible [Allemagne] ; Henning Fernau [Allemagne]	An Amortized Search Tree Analysis for k -Leaf Spanning Tree
001752 (2001)	Jürgen Forster [Allemagne] ; Matthias Krause [Allemagne] ; Satyanarayana V. Lokam [États-Unis] ; Rustam Mubarakzjanov [Allemagne] ; Niels Schmitt [Allemagne] ; Hans Ulrich Simon [Allemagne]	Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
001852 (1994)	J. W. Poesen [Belgique] ; D. Torri [Italie] ; K. Bunte [Belgique]	Effects of rock fragments on soil erosion by water at different spatial scales: a review
001923 (1998)	J. G. March [États-Unis] ; J. P. Benstead [États-Unis] ; C. M. Pringle [États-Unis] ; F. N. Scatena [États-Unis]	Migratory drift of larval freshwater shrimps in two tropical streams, Puerto Rico
001A12 (2009)	Henning Fernau [Allemagne] ; Joachim Kneis [Allemagne] ; Dieter Kratsch [France] ; Alexander Langer [Allemagne] ; Mathieu Liedloff [France] ; Daniel Raible [Allemagne] ; Peter Rossmanith [Allemagne]	An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
001A16 (2010)	Daniel Binkele-Raible [Allemagne] ; Ljiljana Brankovic [Australie] ; Henning Fernau [Allemagne] ; Joachim Kneis [Allemagne] ; Dieter Kratsch [France] ; Alexander Langer [Allemagne] ; Mathieu Liedloff [France] ; Peter Rossmanith [Allemagne]	A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
001A26 (2011)	Henning Fernau [Allemagne] ; Fedor V. Fomin [Norvège] ; Daniel Lokshtanov [Norvège] ; Matthias Mnich [Pays-Bas] ; Geevarghese Philip [Inde] ; Saket Saurabh [Inde]	Ranking and Drawing in Subexponential Time

---

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

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

---

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