Complexité algorithme < Complexité calcul < Complexité communication

Facettes :

List of bibliographic references indexed by Complexité calcul

Number of relevant bibliographic references: 32.
[0-20] [0 - 20][0 - 32][20-31][20-40]

Ident.	Authors (with country if any)	Title
000846 (2012)	Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne]	Parameterized Measure & Conquer for Problems with No Small Kernels
000F71 (2009)	Henning Fernau [Allemagne] ; Juan A. Rodriguez [Espagne] ; José M. Sigarreta [Mexique]	Offensive r-alliances in graphs
001212 (2008)	Ralf Kiisters [Allemagne] ; Anupam Datta [États-Unis] ; John C. Mitchell [États-Unis] ; Ajith Ramanathan [États-Unis]	On the Relationships between Notions of Simulation-Based Security
001222 (2008)	JIONG GUO [Allemagne] ; Rolf Niedermeier [Allemagne] ; Daniel Raible [Allemagne]	Improved Algorithms and Complexity Results for Power Domination in Graphs
001486 (2006)	Faisal N. Abu-Khzam [Liban] ; Henning Fernau [Allemagne]	Kernels: Annotated, Proper and Induced
001969 (2004)	Volker Schulz [Allemagne]	Simultaneous solution approaches for large optimization problems
001D96 (2001)	M. Fahl [Allemagne]	Computation of POD basis functions for fluid flows with lanczos methods
001E22 (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
001F24 (2000)	R. J. Gardner [États-Unis] ; P. Gritzmann [Allemagne] ; D. Prangenberg [Allemagne]	On the computational complexity of determining polyatomic structures by X-rays
001F25 (2000)	Martin Mundhenk [Allemagne]	On hard instances
002018 (2000)	M. Mundhenk [Allemagne]	Complexity of optimal small policies
002019 (2000)	M. Mundhenk [Allemagne] ; J. Goldsmith ; C. Lusena ; E. Allender	Complexity of finite-horizon Markov decision process problems
002080 (1999)	Stasys Jukna [Allemagne, Lituanie]	Linear codes are hard for oblivious read-once parity branching programs
002092 (1999)	Carsten Damm [Allemagne]	Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones
002289 (1998)	Carsten Damm [Allemagne]	On Boolean vs. Modular arithmetic for circuits and communication protocols
002335 (1998)	C. W. Kessler [Allemagne]	Scheduling expression DAGs for minimal register need
002348 (1998)	M. Mundhenk [Allemagne] ; A. Slobodova [Allemagne]	Optimal non-approximability of MAXCLIQUE
002360 (1998)	A. Czumaj [Allemagne] ; P. Kanarek [Pologne] ; M. Kutyłowski [Allemagne] ; K. Lorys [Allemagne]	Fast generation of random permutations via networks simulation
002444 (1997)	Klaus Jansen [Allemagne] ; Petra Scheffler [Allemagne]	Generalized coloring for tree-like graphs
002455 (1997)	Klaus Jansen [Allemagne]	The optimum cost chromatic partition problem
002458 (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

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/PascalFr.i -k "Complexité calcul" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/PascalFr.i  \
                -Sk "Complexité calcul" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    PascalFr.i
   |clé=    Complexité calcul
}}

---

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