complexities < complexity < compliance

Facettes :

List of bibliographic references

Number of relevant bibliographic references: 67.
[0-20] [0 - 20][0 - 50][20-40]

Ident.	Authors (with country if any)	Title
000711 (2007)	A. M. Giese [Allemagne] ; C. Kaebe [Allemagne] ; J. H. Maruhn [Allemagne] ; E. W. Sachs [Allemagne, États-Unis]	Efficient calibration for problems in option pricing
000750 (1977)	Walter Hussy [Allemagne] ; Reinhold Scheller [Allemagne]	Human information processing and intelligence
000876 (1999)		Working With Racially Motivated Offenders
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
000936 (1995)	V. Arvind [Inde] ; J. Köbler [Allemagne] ; M. Mundhenk [Allemagne]	On reductions to sets that avoid EXPSPACE
000978 (2003)	Ralph Bergmann [Allemagne] ; Klaus-Dieter Althoff [Allemagne] ; Sean Breen [Irlande (pays)] ; Mehmet Göker [États-Unis] ; Michel Manago [France] ; Ralph Traphöner [Allemagne] ; Stefan Wess [Allemagne]	9. Developing Maintenance Applications
000997 (1994)	Klaus Jansen [Allemagne]	An approximation algorithm for the license and shift class design problem
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
000C67 (1995)	Carsten Damm [Allemagne] ; Markus Holzer [Allemagne]	Automata that take advice
000C69 (2000)	Vikraman Arvind [Inde] ; Johannes Köbler [Allemagne] ; Martin Mundhenk [Allemagne] ; Jacobo Torán [Allemagne]	Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
000D49 (1996)	C. Meinel [Allemagne] ; S. Waack [Allemagne]	Lower bounds for the majority communication complexity of various graph accessibility problems
000D54 (2001)	Michael R. Fellows [Australie]	Parameterized Complexity: The Main Ideas and Some Research Frontiers
000D83 (2002)	Christoph Meinel [Allemagne] ; Christian Stangier [Allemagne]	Algorithms and Heuristics in VLSI Design
000E09 (2005)	Marc Ehrig [Allemagne] ; York Sure [Allemagne] ; Steffen Staab	Supervised Learning of an Ontology Alignment Process
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
000E95 (1998)	Anna Slobodová [Allemagne]	On the composition problem for OBDDs with multiple variable orders
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
000F73 (2010)	Ljiljana Brankovic [Australie] ; Henning Fernau [Allemagne]	Combining Two Worlds: Parameterised Approximation for Vertex Cover

---

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

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

---

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