complexities < complexity < compliance

Facettes :

List of bibliographic references indexed by complexity

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

Ident.	Authors (with country if any)	Title
000915 (2011)	Michele Griessmair [Allemagne] ; Guido Strunk ; Rudolf Vetschera ; Sabine T. Koeszegi	Complexity in electronic negotiation support systems.
000E18 (2009)	Gábor Erdélyi [Allemagne] ; Henning Fernau [Allemagne] ; Judy Goldsmith [États-Unis] ; Nicholas Mattei [États-Unis] ; Daniel Raible [Allemagne] ; Jörg Rothe [Allemagne]	The Complexity of Probabilistic Lobbying
001222 (2008)	JIONG GUO [Allemagne] ; Rolf Niedermeier [Allemagne] ; Daniel Raible [Allemagne]	Improved Algorithms and Complexity Results for Power Domination in Graphs
001C63 (2002)	Flemming Nielson [Danemark] ; Hanne Riis Nielson [Danemark] ; Helmut Seidl [Allemagne]	Automatic Complexity Analysis
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
001E26 (2001)	Michael R. Fellows [Australie]	Parameterized Complexity: The Main Ideas and Some Research Frontiers
001F54 (2000)	Vikraman Arvind [Inde] ; Johannes Köbler [Allemagne] ; Martin Mundhenk [Allemagne] ; Jacobo Torán [Allemagne]	Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
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
002457 (1997)	J. Bern [Allemagne] ; C. Damm [Allemagne] ; Ch Meinel [Allemagne]	The electronic colloquium on computational complexity (ECCC): A digital library in use
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
002742 (1996)	V. Arvind [Inde] ; J. Köbler [Allemagne] ; M. Mundhenk [Allemagne]	Upper bounds for the complexity of sparse and tally descriptions
002746 (1996)	Christoph Meinel [Allemagne] ; Stephan Waack	The “log rank” conjecture for modular communication complexity
002754 (1996)	Carsten Damm [Allemagne] ; Stasys Jukna [Allemagne] ; Ji Sgall [République tchèque]	Some bounds on multiparty communication complexity of pointer jumping
002773 (1996)	Christoph Meinel [Allemagne] ; S. Waack [Allemagne]	Lower bounds for the majority communication complexity of various graph accessibility problems
002932 (1995)	Christoph Meinel [Allemagne] ; S. Waack [Allemagne]	Separating complexity classes related to bounded alternating ω-branching programs
002951 (1995)	Christoph Meinel [Allemagne] ; Stephan Waack	Lower bounds for the majority communication complexity of various graph accessibility problems
002A96 (1994)	Christoph Meinel [Allemagne] ; Anna Slobodová [Allemagne]	On the complexity of constructing optimal ordered binary decision diagrams
002C06 (1993)	Klaus Jansen [Allemagne, Autriche] ; Gerhard J. Woeginger [Allemagne, Autriche]	The complexity of detecting crossingfree configurations in the plane
002C09 (1993)	Christoph Meinel [Allemagne] ; Stephan Waack [Allemagne]	Separating complexity classes related to bounded alternating Ω-branching programs
002C19 (1993)	Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne]	On the complexity of scheduling incompatible jobs with unit-times

---

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/Title.i -k "complexity" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i  \
                -Sk "complexity" \
         | 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=    Title.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