Complexité algorithme < Complexité calcul < Complexité communication

Facettes :

List of bibliographic references indexed by Complexité calcul

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

Ident.	Authors (with country if any)	Title
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
002474 (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
002479 (1997)	Martin Mundhenk [Allemagne]	NP-hard sets have many hard instances
002505 (1997)	Christoph Meinel [Allemagne] ; Anna Slobodová [Allemagne]	A reducibility concept for problems defined in terms of ordered binary decision diagrams
002722 (1996)	Helmut Seidl [Allemagne]	Fast and simple nested fixpoints
002823 (1996)	V. Arvind [Inde] ; J. Köbler [Allemagne] ; M. Mundhenk [Allemagne]	Monotonous and randomized reductions to sparse sets
002825 (1996)	M. Kutylowski [Allemagne] ; K. Lorys [Allemagne]	Limitations of the QRQW and EREW PRAM models
002912 (1995)	Stasys Jukna [Allemagne]	Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
002A44 (1994)	Jordan Gergov [Allemagne] ; Christoph Meinel [Allemagne]	On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
002B78 (1993)	Klaus Jansen [Allemagne]	Scheduling with constrained processor allocation for interval orders
002C75 (1993)	P. Gritzmann [Allemagne] ; B. Sturmfels	Minkowski addition of polytopes: computational complexity and applications to Gröbner bases
002C81 (1993)	P. Gritzmann [Allemagne] ; V. Klee	Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces

---

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