Complexité algorithme < Complexité calcul < Complexité communication

Facettes :

List of bibliographic references

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

Ident.	Authors (with country if any)	Title
000198 (2012)	Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne]	Parameterized Measure & Conquer for Problems with No Small Kernels
000497 (2009)	Henning Fernau [Allemagne] ; Juan A. Rodriguez [Espagne] ; José M. Sigarreta [Mexique]	Offensive r-alliances in graphs
000605 (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
000617 (2008)	JIONG GUO [Allemagne] ; Rolf Niedermeier [Allemagne] ; Daniel Raible [Allemagne]	Improved Algorithms and Complexity Results for Power Domination in Graphs
000755 (2006)	Faisal N. Abu-Khzam [Liban] ; Henning Fernau [Allemagne]	Kernels : Annotated, proper and induced
000895 (2004)	Volker Schulz [Allemagne]	Simultaneous solution approaches for large optimization problems
000B86 (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
000C09 (2001)	M. Fahl [Allemagne]	Computation of POD basis functions for fluid flows with Lanczos methods
000C73 (2000)	R. J. Gardner [États-Unis] ; P. Gritzmann [Allemagne] ; D. Prangenberg [Allemagne]	On the computational complexity of determining polyatomic structures by X-rays
000C74 (2000)	M. Mundhenk [Allemagne]	On hard instances
000D10 (2000)	M. Mundhenk [Allemagne]	Complexity of optimal small policies
000D11 (2000)	M. Mundhenk [Allemagne] ; J. Goldsmith ; C. Lusena ; E. Allender	Complexity of finite-horizon Markov decision process problems
000D83 (1999)	S. Jukna [Allemagne, Lituanie]	Linear codes are hard for oblivious read-once parity branching programs
000D98 (1999)	C. Damm [Allemagne]	Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones
000E59 (1998)	C. W. Kessler [Allemagne]	Scheduling expression DAGs for minimal register need
000E76 (1998)	M. Mundhenk [Allemagne] ; A. Slobodova [Allemagne]	Optimal non-approximability of MAXCLIQUE
000E83 (1998)	C. Damm [Allemagne]	On Boolean vs. modular arithmetic for circuits and communication protocols
000F01 (1998)	A. Czumaj [Allemagne] ; P. Kanarek [Pologne] ; M. Kutyłowski [Allemagne] ; K. Lorys [Allemagne]	Fast generation of random permutations via networks simulation
000F93 (1997)	K. Jansen [Allemagne]	The optimum cost chromatic partition problem
000F99 (1997)	M. Mundhenk [Allemagne] ; J. Goldsmith [États-Unis] ; E. Allender [États-Unis]	The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes
001031 (1997)	S. Jukna [Allemagne] ; A. Razborov [Russie] ; P. Savicky [République tchèque] ; I. Wegener [Allemagne]	On P versus NP∩co-NP for decision trees and read-once branching programs

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/PascalFr.i -k "Complexité calcul" 

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

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

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |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